Information-theoretic co-clustering
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers
Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
A general model for clustering binary data
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
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
The complex dynamics of collaborative tagging
Proceedings of the 16th international conference on World Wide Web
A probabilistic framework for relational clustering
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
A Generalized Maximum Entropy Approach to Bregman Co-clustering and Matrix Approximation
The Journal of Machine Learning Research
Network properties of folksonomies
AI Communications - Network Analysis in Natural Sciences and Engineering
Relational learning via collective matrix factorization
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
A Unified View of Matrix Factorization Models
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
Community Learning by Graph Approximation
ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
MetaFac: community discovery via relational hypergraph factorization
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Extracting Multi-facet Community Structure from Bipartite Networks
CSE '09 Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 04
Exploit the tripartite network of social tagging for web clustering
Proceedings of the 18th ACM conference on Information and knowledge management
Empirical comparison of algorithms for network community detection
Proceedings of the 19th international conference on World wide web
Detecting communities from tripartite networks
Proceedings of the 19th international conference on World wide web
Networks: An Introduction
Modularity for heterogeneous networks
Proceedings of the 21st ACM conference on Hypertext and hypermedia
Paper: Modeling by shortest data description
Automatica (Journal of IFAC)
Detecting profilable and overlapping communities with user-generated multimedia contents in LBSNs
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Hi-index | 0.00 |
In social tagging systems such as Delicious and Flickr, users collaboratively manage tags to annotate resources. Naturally, a social tagging system can be modeled as a (user, tag, resource) hypernetwork, where there are three different types of nodes namely users, resources and tags, and each hyperedge has three end nodes, connecting a user, a resource and a tag that the user employs to annotate the resource. Then how can we automatically cluster related users, resources and tags, respectively? This is a problem of community detection in a 3-partite, 3-uniform hypernetwork. More generally, given a K-partite K-uniform (hyper)network, where each (hyper)edge is a K-tuple composed of nodes of K different types, how can we automatically detect communities for nodes of different types? In this paper, by turning this problem into a problem of finding an efficient compression of the (hyper)network's structure, we propose a quality function for measuring the goodness of partitions of a K-partite K-uniform (hyper)network into communities, and develop a fast community detection method based on optimization. Our method overcomes the limitations of state of the art techniques and has several desired properties such as comprehensive, parameter-free, and scalable. We compare our method with existing methods in both synthetic and real-world datasets.