Static and dynamic information organization with star clusters
Proceedings of the seventh international conference on Information and knowledge management
Web document clustering: a feasibility demonstration
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Efficient Phrase-Based Document Indexing for Web Document Clustering
IEEE Transactions on Knowledge and Data Engineering
The Evaluation Measure of Text Clustering for the Variable Number of Clusters
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks
A Clustering Algorithm Based on Generalized Stars
MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
An Algorithm to Find Overlapping Community Structure in Networks
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
A Fast Algorithm to Find Overlapping Communities in Networks
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Characterization and evaluation of similarity measures for pairs of clusterings
Knowledge and Information Systems
A comparison of extrinsic clustering evaluation metrics based on formal constraints
Information Retrieval
A New Incremental Algorithm for Overlapped Clustering
CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Dynamic hierarchical algorithms for document clustering
Pattern Recognition Letters
ACONS: a new algorithm for clustering documents
CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
Finding Overlapping Communities in Social Networks
SOCIALCOM '10 Proceedings of the 2010 IEEE Second International Conference on Social Computing
SimClus: an effective algorithm for clustering with a lower bound on similarity
Knowledge and Information Systems - Special Issue on Data Warehousing and Knowledge Discovery from Sensors and Streams
Efficient identification of overlapping communities
ISI'05 Proceedings of the 2005 IEEE international conference on Intelligence and Security Informatics
| Hi-index | 0.00 |
Most of the clustering algorithms reported in the literature build disjoint clusters; however, there are several applications where overlapping clustering is useful and important. Although several overlapping clustering algorithms have been proposed, most of them have a high computational complexity or they have some limitations which reduce their usefulness in real problems. In this paper, we introduce a new overlapping clustering algorithm, which solves the limitations of previous algorithms, while it has an acceptable computational complexity. The experimentation, conducted over several standard collections, demonstrates the good performance of the proposed algorithm.