Incremental clustering and dynamic information retrieval
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximate medians and other quantiles in one pass and with limited memory
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Virtual Community: Homesteading on the Electronic Frontier
The Virtual Community: Homesteading on the Electronic Frontier
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Document clustering based on non-negative matrix factorization
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Streaming-Data Algorithms for High-Quality Clustering
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Segmentation Given Partial Grouping Constraints
IEEE Transactions on Pattern Analysis and Machine Intelligence
Updating pagerank with iterative aggregation
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Incremental page rank computation on evolving graphs
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Evolutionary spectral clustering by incorporating temporal smoothness
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
A framework for clustering evolving data streams
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Tracking clusters in evolving data streams over sliding windows
Knowledge and Information Systems
Pattern Recognition
Eigenvector sensitive feature selection for spectral clustering
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Unsupervised video surveillance
ACCV'10 Proceedings of the 2010 international conference on Computer vision - Volume Part I
Distributed spectral cluster management: a method for building dynamic publish/subscribe systems
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
Evolving social data mining and affective analysis methodologies, framework and applications
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Semi-supervised action recognition in video via Labeled Kernel Sparse Coding and sparse L1 graph
Pattern Recognition Letters
Models of social groups in blogosphere based on information about comment addressees and sentiments
SocInfo'12 Proceedings of the 4th international conference on Social Informatics
Weighted Fuzzy-Possibilistic C-Means Over Large Data Sets
International Journal of Data Warehousing and Mining
Spatio-temporal feature-based keyframe detection from video shots using spectral clustering
Pattern Recognition Letters
Clustering and outlier detection using isoperimetric number of trees
Pattern Recognition
Efficient eigen-updating for spectral graph clustering
Neurocomputing
Adaptive evolutionary clustering
Data Mining and Knowledge Discovery
Multimedia Tools and Applications
Hi-index | 0.01 |
In recent years, the spectral clustering method has gained attentions because of its superior performance. To the best of our knowledge, the existing spectral clustering algorithms cannot incrementally update the clustering results given a small change of the data set. However, the capability of incrementally updating is essential to some applications such as websphere or blogsphere. Unlike the traditional stream data, these applications require incremental algorithms to handle not only insertion/deletion of data points but also similarity changes between existing points. In this paper, we extend the standard spectral clustering to such evolving data, by introducing the incidence vector/matrix to represent two kinds of dynamics in the same framework and by incrementally updating the eigen-system. Our incremental algorithm, initialized by a standard spectral clustering, continuously and efficiently updates the eigenvalue system and generates instant cluster labels, as the data set is evolving. The algorithm is applied to a blog data set. Compared with recomputation of the solution by the standard spectral clustering, it achieves similar accuracy but with much lower computational cost. It can discover not only the stable blog communities but also the evolution of the individual multi-topic blogs. The core technique of incrementally updating the eigenvalue system is a general algorithm and has a wide range of applications-as well as incremental spectral clustering-where dynamic graphs are involved. This demonstrates the wide applicability of our incremental algorithm.