.png){kind=icon}
Return
Hierarchical high-order co-clustering algorithm by maximizing modularity
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-021-01375-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The star-structured high-order heterogeneous data is ubiquitous, such data represent objects of a certain type, connected to other types of data, or the features, so that the overall data schema forms a star-structure of inter-relationships. In this paper, we study the problem of co-clustering of star-structured high-order heterogeneous data. We present a new solution, a Hierarchical High-order Co-clustering Algorithm by Maximizing Modularity, MHCoC, which iteratively optimizes the objective function based on modularity and finally converges to a unique clustering result. In contrast to the traditional co-clustering methods, MHCoC merges information of multiple feature spaces of high-order heterogeneous data. Moreover, MHCoC takes a top-down strategy to perform a greedy divisive procedure, generating a tree-like hierarchical clustering result that reveal the relationship between clusters. To illustrate the process in more detail, we design a toy example to describe how MHCoC selects the appropriate co-cluster and splits it. Extensive experiments on real-world datasets demonstrate the effectiveness of the proposed method.
Keywords:
Co-clustering
Modularity
High-order heterogeneous data
Hierarchical structure
Journal
IF:
2.7
Papers:
3.2K
Citations:
5.6K
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveEffectiveness of combined chain exercises on pain and function in patients with knee osteoarthritis
OAAI
OAAIShareSaveShareSave View more