Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Co-clustering documents and words using bipartite spectral graph partitioning
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Bipartite graph partitioning and data clustering
Proceedings of the tenth international conference on Information and knowledge management
Global optimization algorithm for the nonlinearsum of ratios problem
Journal of Optimization Theory and Applications
A Comparative Study on Feature Selection in Text Categorization
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
A Unified Framework for Clustering Heterogeneous Web Objects
WISE '02 Proceedings of the 3rd International Conference on Web Information Systems Engineering
Feature Weighting in k-Means Clustering
Machine Learning
ReCoM: reinforcement clustering of multi-type interrelated data objects
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Information-theoretic co-clustering
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Convex Optimization
Image and Feature Co-Clustering
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 4 - Volume 04
IEEE Transactions on Knowledge and Data Engineering
Web image clustering by consistent utilization of visual features and surrounding texts
Proceedings of the 13th annual ACM international conference on Multimedia
Spectral clustering for multi-type relational data
ICML '06 Proceedings of the 23rd international conference on Machine learning
Unsupervised learning on k-partite graphs
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
A probabilistic framework for relational clustering
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Possibilistic fuzzy co-clustering of large document collections
Pattern Recognition
Learning correlations using the mixture-of-subsets model
ACM Transactions on Knowledge Discovery from Data (TKDD)
Approximation algorithms for co-clustering
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Real-time automatic tag recommendation
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Community evolution in dynamic multi-mode networks
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Correlating Time-Related Data Sources with Co-clustering
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Data weaving: scaling up the state-of-the-art in data clustering
Proceedings of the 17th ACM conference on Information and knowledge management
Scalable community discovery on textual data with relations
Proceedings of the 17th ACM conference on Information and knowledge management
Predicting Click Rates by Consistent Bipartite Spectral Graph Model
ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Towards bipartite graph data management
CloudDB '10 Proceedings of the second international workshop on Cloud data management
PCM'10 Proceedings of the 11th Pacific Rim conference on Advances in multimedia information processing: Part I
Improving Recommender Systems by Incorporating Social Contextual Information
ACM Transactions on Information Systems (TOIS)
High-order co-clustering text data on semantics-based representation model
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part I
Information marginalization on subgraphs
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
An information-theoretic framework for high-order co-clustering of heterogeneous objects
ECML'06 Proceedings of the 17th European conference on Machine Learning
An information-theoretic framework for process structure and data mining
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
On context-aware co-clustering with metadata support
Journal of Intelligent Information Systems
A tripartite clustering analysis on microRNA, gene and disease model
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Detecting communities in K-partite K-uniform (hyper)networks
Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation
Event-based social networks: linking the online and offline social worlds
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Social recommendation across multiple relational domains
Proceedings of the 21st ACM international conference on Information and knowledge management
Social event detection with robust high-order co-clustering
Proceedings of the 3rd ACM conference on International conference on multimedia retrieval
Hi-index | 0.00 |
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two types of heterogeneous data (denoted by pair-wise co-clustering), such as documents and terms, have been well studied in the literature, the work on more types of heterogeneous data (denoted by high-order co-clustering) is still very limited. As an attempt in this direction, in this paper, we worked on a specific case of high-order co-clustering in which there is a central type of objects that connects the other types so as to form a star structure of the inter-relationships. Actually, this case could be a very good abstract for many real-world applications, such as the co-clustering of categories, documents and terms in text mining. In our philosophy, we treated such kind of problems as the fusion of multiple pair-wise co-clustering sub-problems with the constraint of the star structure. Accordingly, we proposed the concept of consistent bipartite graph co-partitioning, and developed an algorithm based on semi-definite programming (SDP) for efficient computation of the clustering results. Experiments on toy problems and real data both verified the effectiveness of our proposed method.