Query：
学者姓名：廖湖声
Refining：
Year
Type
Indexed by
Source
Complex
Co-Author
Language
Clean All
Abstract ：
Multi-view clustering, which improves clustering performance by exploring complementarity and consistency among multiple distinct feature sets, is attracting more and more researchers due to its wide applications in various fields e.g., pattern recognition and data mining. Traditional approaches usually explore above characteristics by mapping different views to a unified embedding through view-specific mapping matrices or neural networks. Then the unified embedding is fed into conventional single view clustering algorithms for final clustering results. However, a unified embedding is not enough to model distinct or even conflict multiple view characteristics due to their diverse representation abilities. Moreover, clustering and embedding learning are divided into two separate parts, which may bring in a gap between the class label and the learned embedding. To alleviate above problems, both unified and view-specific embeddings are learned, and a shared operator tensor and view-specific latent variables are introduced for their relationship modeling. Besides, a Kullback-Liebler divergence based objective is developed as a clustering oriented constraint, which leads to more clustering friendly embedding learned. Extensive experiments are conducted on six widely used datasets, achieving better results compared with several state-of-the-art approaches.
Keyword ：
Clustering friendly embedding learning Clustering friendly embedding learning Kullback-Liebler divergence Kullback-Liebler divergence Multi-view clustering Multi-view clustering Embeddings relationship modeling Embeddings relationship modeling
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Li, Yongzhen , Liao, Husheng . Diverse embeddings learning for multi-view clustering [J]. | PATTERN ANALYSIS AND APPLICATIONS , 2025 , 28 (1) . |
| MLA | Li, Yongzhen 等. "Diverse embeddings learning for multi-view clustering" . | PATTERN ANALYSIS AND APPLICATIONS 28 . 1 (2025) . |
| APA | Li, Yongzhen , Liao, Husheng . Diverse embeddings learning for multi-view clustering . | PATTERN ANALYSIS AND APPLICATIONS , 2025 , 28 (1) . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
针对多视角数据间互补与一致特性难以刻画问题,提出一种基于图卷积神经网络的多视角聚类方法。通过对样本不同视角间相同邻接子图基于图卷积神经网络学习到的表达进行约束,有效挖掘了多视角数据间的一致特性。通过共享图卷积神经网络参数、学习不同视角完整邻接图嵌入表达并串接得到多视角表达,有效挖掘了多视角数据间的互补特性。对上述多视角表达增加相对熵约束,使得最终学习到的多视角表达得以提升并符合聚类特性。在五个数据集上均取得了最好的聚类效果,说明所提出的基于图卷积神经网络的聚类方法可以有效挖掘视角间互补与一致特性并提升聚类性能。
Keyword ：
相对熵 相对熵 图卷积神经网络 图卷积神经网络 多视角聚类 多视角聚类
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 李勇振 , 廖湖声 . 基于图卷积神经网络的多视角聚类 [J]. | 计算机工程与应用 , 2021 , 57 (05) : 115-122 . |
| MLA | 李勇振 等. "基于图卷积神经网络的多视角聚类" . | 计算机工程与应用 57 . 05 (2021) : 115-122 . |
| APA | 李勇振 , 廖湖声 . 基于图卷积神经网络的多视角聚类 . | 计算机工程与应用 , 2021 , 57 (05) , 115-122 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
基于图卷积神经网络的多视角聚类
Keyword ：
图卷积神经网络 图卷积神经网络 相对熵 相对熵 多视角聚类 多视角聚类
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 李勇振 , 廖湖声 , 计算机工程与应用 . 基于图卷积神经网络的多视角聚类 [J]. | 李勇振 , 2021 , 57 (5) : 115-122 . |
| MLA | 李勇振 等. "基于图卷积神经网络的多视角聚类" . | 李勇振 57 . 5 (2021) : 115-122 . |
| APA | 李勇振 , 廖湖声 , 计算机工程与应用 . 基于图卷积神经网络的多视角聚类 . | 李勇振 , 2021 , 57 (5) , 115-122 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
Multi-view clustering, which explores complementarity and consistency among multiple distinct feature sets to boost clustering performance, is becoming more and more useful in many real-world applications. Traditional approaches usually map multiple views to a unified embedding, in which some weighted mechanisms are utilized to measure the importance of each view. The embedding, serving as a clustering friendly representation, is then sent to extra clustering algorithms. However, a unified embedding cannot cover both complementarity and consistency among views and the weighted scheme measuring the importance of each view as a whole ignores the differences of features in each view. Moreover, because of lacking in proper grouping structure constraint imposed on the unified embedding, it will lead to just multi-view representation learned, which is not clustering friendly. In this paper, we propose a novel multi-view clustering method to alleviate the above problems. By dividing the embedding of a view into unified and view-specific vectors explicitly, complementarity and consistency can be reflected. Besides, an adversarial learning process is developed to force the above embeddings to be non-trivial. Then a fusion strategy is automatically learned, which will adaptively adjust weights for all the features in each view. Finally, a Kullback-Liebler (KL) divergence based objective is developed to constrain the fused embedding for clustering friendly representation learning and to conduct clustering. Extensive experiments have been conducted on various datasets, performing better than the state-of-the-art clustering approaches.
Keyword ：
Clustering friendly representation learning Clustering friendly representation learning Multi-view clustering Multi-view clustering Adaptive view fusion Adaptive view fusion Adversarial view embedding Adversarial view embedding
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Li, Yongzhen , Liao, Husheng . Multi-view clustering via adversarial view embedding and adaptive view fusion [J]. | APPLIED INTELLIGENCE , 2020 , 51 (3) : 1201-1212 . |
| MLA | Li, Yongzhen 等. "Multi-view clustering via adversarial view embedding and adaptive view fusion" . | APPLIED INTELLIGENCE 51 . 3 (2020) : 1201-1212 . |
| APA | Li, Yongzhen , Liao, Husheng . Multi-view clustering via adversarial view embedding and adaptive view fusion . | APPLIED INTELLIGENCE , 2020 , 51 (3) , 1201-1212 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
This paper proposes a new kind of pushdown transducer ExPDT to do XML data stream evaluation effectively and efficiently for XPath queries with parallel predicates, multilevel nested predicates and predicates with value. Compared with relative researches, ExPDT expands the support of XPath queries, and the experiment shows that it improves the performance of XML data stream evaluation. © 2019 IEEE.
Keyword ：
Data streams Data streams XML XML Transducers Transducers
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Jin, Xueyun , Liao, Husheng . ExPDT: An extended pushdown transducer for xml stream processing [C] . 2019 : 1048-1052 . |
| MLA | Jin, Xueyun 等. "ExPDT: An extended pushdown transducer for xml stream processing" . (2019) : 1048-1052 . |
| APA | Jin, Xueyun , Liao, Husheng . ExPDT: An extended pushdown transducer for xml stream processing . (2019) : 1048-1052 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
To improve the detective ability of complex event processing (CEP), we combine interval temporal logic (ITL) and regular expression in pattern description of event streams constraint. We propose different timed automata to support varied ITL. The pattern described by regular expression improves the simplicity of the pattern description. Meanwhile, we have implemented above technique in a CEP system to test performance. The experimental evaluation shows that the pattern can be efficiently and accurately matched.
Keyword ：
Interval temporal logic Interval temporal logic Complex event processing Complex event processing Regular expression Regular expression
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhang, Jia-wei , Liao, Hu-sheng , Gao, Hong-yu et al. Research on Complex Event Detection over Streams Supporting Interval Temporal Logic and Regular Expression Pattern Matching [C] . 2018 : 464-470 . |
| MLA | Zhang, Jia-wei et al. "Research on Complex Event Detection over Streams Supporting Interval Temporal Logic and Regular Expression Pattern Matching" . (2018) : 464-470 . |
| APA | Zhang, Jia-wei , Liao, Hu-sheng , Gao, Hong-yu , Su, Chang . Research on Complex Event Detection over Streams Supporting Interval Temporal Logic and Regular Expression Pattern Matching . (2018) : 464-470 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
The ordered regular tree pattern can be used for processing complex events on XML stream data. It not only can constrain the structural relationships among events, but also can constrain sequential constraint. The ordered regular tree pattern has strong descriptive ability for complex events. In order to further improve the query processing efficiency of the ordered regular tree model, this paper presents a method to optimize the ordered normal tree using the semantic information and structure information of DTD. Experimental results show that this optimization method can effectively improve the execution efficiency of the ordered regular tree pattern.
Keyword ：
ordered regular tree pattern ordered regular tree pattern DTD DTD query optimization query optimization XML stream data XML stream data complex event detection complex event detection
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | E Xinyu , Liao Husheng , Su Hang . Research on XML Ordered Regular Tree Pattern Optimization Method [C] . 2018 : 229-234 . |
| MLA | E Xinyu et al. "Research on XML Ordered Regular Tree Pattern Optimization Method" . (2018) : 229-234 . |
| APA | E Xinyu , Liao Husheng , Su Hang . Research on XML Ordered Regular Tree Pattern Optimization Method . (2018) : 229-234 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
Complex event processing is a technology that obtains valuable complex events from the low value of single events, and is widely used in the network system of big data era. In order to solve the need of 'rich the description language of complex event' and 'promote the efficiency of event stream pattern matching', an original scheme of complex event detection is proposed in this study. It adopts the regular tree pattern to describe the complex events, which can not only describe the structure but also the timing constraints of events. Based on the means of tree ordering, automaton and mapping table, the scheme combines data-parallel and task-parallel and make full use of the multi-core advantage of computers. The experimental results show that the scheme has a high performance on complex event detection. © 2018 Association for Computing Machinery.
Keyword ：
Information systems Information systems Information use Information use Forestry Forestry Big data Big data Pattern matching Pattern matching Data streams Data streams Computer hardware description languages Computer hardware description languages Trees (mathematics) Trees (mathematics) Parallel algorithms Parallel algorithms Complex networks Complex networks
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Yan, Lei , Liao, Husheng , Su, Hang . Parallel complex event detection based on regular tree pattern matching [C] . 2018 : 34-39 . |
| MLA | Yan, Lei et al. "Parallel complex event detection based on regular tree pattern matching" . (2018) : 34-39 . |
| APA | Yan, Lei , Liao, Husheng , Su, Hang . Parallel complex event detection based on regular tree pattern matching . (2018) : 34-39 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
XML tree pattern query, also known as Twig query, is the core operation in XML query processing. In the research of the Twig query algorithm, TreeMatch is considered to be one of the best algorithms because it reduces the generation of intermediate results. However, in the core operation getNext of the TreeMatch algorithm, there are many calculations that depend only on Twig mode. This redundant duplicate calculation affects the performance of the TreeMatch algorithm when there are many getNext calls. In order to further improve the algorithm, this paper proposes a Twig query optimization method based on partial evaluation and hot-trace compilation. This method takes Twig mode as an invariant to perform partial evaluation and translates query requests into a Twig query machine instruction sequence. The duplication calculation of the Twig pattern during the query process is avoided, and the process of interpretation of the instruction sequence of the query machine is optimized by using the hot trace compilation technique. The comparison experiment shows that the optimization method based on partial evaluation and hot-trace compilation can increase the efficiency of twig query by 20% to 60%. © 2018 Totem Publisher, Inc. All rights reserved.
Keyword ：
XML XML Forestry Forestry
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | He, Zhixue , Wang, Huan , Liao, Husheng . An optimization method for XML twig query [J]. | International Journal of Performability Engineering , 2018 , 14 (10) : 2309-2319 . |
| MLA | He, Zhixue et al. "An optimization method for XML twig query" . | International Journal of Performability Engineering 14 . 10 (2018) : 2309-2319 . |
| APA | He, Zhixue , Wang, Huan , Liao, Husheng . An optimization method for XML twig query . | International Journal of Performability Engineering , 2018 , 14 (10) , 2309-2319 . |
| Export to | NoteExpress RIS BibTex |
Abstract ：
复杂事件处理技术是流数据查询的常见手段，随着数据多元化的发展，查询的复杂度急剧提升，其处理性能面临极大地挑战。为了提高多源复杂事件查询的处理效率，本文提出一种新的查询分解方案，提高集群资源利用率；针对事件源匹配，将查询中的筛选与事件源匹配中的筛选相结合设计了专用优化方案。实验证明以上方法能够有效地提高复杂事件查询效率。
Keyword ：
Pattern Match Pattern Match Query Optimization Query Optimization 查询优化Complex Event Processing 查询优化Complex Event Processing 复杂事件处理 复杂事件处理 模式匹配 模式匹配
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 苏畅 , 廖湖声 , 高红雨 et al. 多源复杂事件检测中查询计划生成与优化技术的研究 [J]. | 软件工程与应用 , 2018 , 7 (02) : 75-83 . |
| MLA | 苏畅 et al. "多源复杂事件检测中查询计划生成与优化技术的研究" . | 软件工程与应用 7 . 02 (2018) : 75-83 . |
| APA | 苏畅 , 廖湖声 , 高红雨 , 张嘉伟 . 多源复杂事件检测中查询计划生成与优化技术的研究 . | 软件工程与应用 , 2018 , 7 (02) , 75-83 . |
| Export to | NoteExpress RIS BibTex |
Export
| Results： |
Selected to |
| Format： |
