iVisClustering: An Interactive Visual Document Clustering via Topic Modeling
The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Abstract
Clustering plays an important role in many large‐scale data analyses providing users with an overall understanding of their data. Nonetheless, clustering is not an easy task due to noisy features and outliers existing in the data, and thus the clustering results obtained from automatic algorithms often do not make clear sense. To remedy this problem, automatic clustering should be complemented with interactive visualization strategies. This paper proposes an interactive visual analytics system for document clustering, called iVisClustering, based on a widely‐used topic modeling method, latent Dirichlet allocation (LDA). iVisClustering provides a summary of each cluster in terms of its most representative keywords and visualizes soft clustering results in parallel coordinates. The main view of the system provides a 2D plot that visualizes cluster similarities and the relation among data items with a graph‐based representation. iVisClustering provides several other views, which contain useful interaction methods. With help of these visualization modules, we can interactively refine the clustering results in various ways. Keywords can be adjusted so that they characterize each cluster better. In addition, our system can filter out noisy data and re‐cluster the data accordingly. Cluster hierarchy can be constructed using a tree structure and for this purpose, the system supports cluster‐level interactions such as sub‐clustering, removing unimportant clusters, merging the clusters that have similar meanings, and moving certain clusters to any other node in the tree structure. Furthermore, the system provides document‐level interactions such as moving mis‐clustered documents to another cluster and removing useless documents. Finally, we present how interactive clustering is performed via iVisClustering by using real‐world document data sets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,370
(1967) · Cited by 23,719
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066 · cited 2×
“…combining the automatic clustering algorithm with interactive visualization techniques. iVisClustering can work with any soft clustering algorithm such as Gaussian mixture model [Bis06] and nonnegative matrix factorization [KP11], while maintaining the full interactive visual capability.”
BackgroundMethodSocial Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,982
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Data clustering: 50 years beyond K-means
Jain, A. K. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.09.011 · Cited by 9,368
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
(2006) · Springer eBooks · Cited by 8,123
Alon, U., Barkai, N., Notterman, D. A., Gish, K., Ybarra, S., Mack, D., & Levine, A. J. (1999) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.96.12.6745 · Cited by 4,167
Probabilistic Latent Semantic Indexing
Hofmann, T. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130370 · Cited by 3,988
Probabilistic latent semantic indexing
Hofmann, T. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312649 · Cited by 3,976 · cited 1×
“LDA also overcomes the drawbacks of other topic models such as naive Bayes model [DP97] and probabilistic latent semantic indexing (pLSI) [Hof99].”
Proceedings of the fifth Berkeley symposium on mathematical statistics and probability.
Kojima, K.-I. (1969) · Europe PMC (PubMed Central) · Cited by 3,648
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability; Vol. IV
Roy, H. L. L., Lecam, L., & Neyman, J. (1969) · Revue de l'Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1402306 · Cited by 2,835
Hierarchical Dirichlet Processes
Teh, Y. W., Jordan, M. I., Beal, M. J., & Blei, D. M. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000302 · Cited by 2,120
Knoke, D., & Yang, S. (2008) · Sage eBooks · doi:10.4135/9781412985864 · Cited by 1,226
SLINK: An optimally efficient algorithm for the single-link cluster method
Sibson, R. (1973) · The Computer Journal · doi:10.1093/comjnl/16.1.30 · Cited by 1,203
Cai, W., Chen, S., & Zhang, D. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2006.07.011 · Cited by 1,088
Centroid-based summarization of multiple documents
Radev, D. R., Jing, H., Styś, M., & Tam, D. (2004) · Information Processing & Management · doi:10.1016/j.ipm.2003.10.006 · Cited by 1,042
prefuse: a toolkit for interactive information visualization
Heer, J., Card, S. K., & Landay, J. A. (2005) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1054972.1055031 · Cited by 802
An efficient algorithm for a complete link method
Defays, D. (1977) · The Computer Journal · doi:10.1093/comjnl/20.4.364 · Cited by 752
Advances in Neural Information Processing Systems 15 (NIPS 2002)
Williams, C. K. I., & Shawe-Taylor, J. S. (2002) · The MIT Press eBooks · Cited by 620
TextFlow: Towards Better Understanding of Evolving Topics in Text
Cui, W., Liu, S., Tan, L., Shi, C., Song, Y., Gao, Z., Qu, H., & Tong, X. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.239 · Cited by 349
Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
Kim, J., & Park, H. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/110821172 · Cited by 328
Self-citationA Rank-by-Feature Framework for Interactive Exploration of Multidimensional Data
Seo, J., & Shneiderman, B. (2005) · Information Visualization · doi:10.1057/palgrave.ivs.9500091 · Cited by 199
Star Coordinates: A Multi-dimensional Visualization Technique with Uniform Treatment of Dimensions
Kandogan, E. (2000) · Cited by 188
Navigating Clustered Graphs Using Force-Directed Methods
Eades, P., & Huang, M. L. (2000) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00029 · Cited by 151
ParallelTopics: A probabilistic approach to exploring document collections
Dou, W., Wang, X., Chang, R., & Ribarsky, W. (2011) · IEEE Conference on Visual Analytics Science and Technology (VAST) · doi:10.1109/vast.2011.6102461 · Cited by 124
iVIBRATE: Interactive visualization-based framework for clustering large datasets
Chen, K., & Liu, L. (2006) · ACM Transactions on Information Systems · doi:10.1145/1148020.1148024 · Cited by 65
Understanding text corpora with multiple facets
Shi, L., Wei, F., Liu, S., Tan, L., Lian, X., & Zhou, M. X. (2010) · IEEE Conference on Visual Analytics Science and Technology (VAST) · doi:10.1109/vast.2010.5652931 · Cited by 59
desJardins, M., MacGlashan, J., & Ferraioli, J. (2007) · ACM International Conference on Intelligent User Interfaces (IUI) · doi:10.1145/1216295.1216367 · Cited by 51
Interactive clustering of text collections according to a user-specified criterion
Bekkerman, R., Raghavan, H., Allan, J., & Eguchi, K. (2007) · Cited by 39
Cited by
A survey on information visualization: recent advances and challenges
Liu, S., Cui, W., Wu, Y., & Liu, M. (2014) · The Visual Computer · doi:10.1007/s00371-013-0892-3 · Cited by 373
Kwon, B. C., Choi, M.-J., Kim, J. T., Choi, E., Kim, Y. B., Kwon, S., Sun, J., & Choo, J. (2019) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2018.2865027 · Cited by 294
“There have been a number of studies to develop tools where users can interact with the results of machine learning tasks such as classification [24,30,53], topic modeling [17,25,50], dimensionality reduction [6,46] and clustering [18, 45, 49].”
BackgroundSelf-citationUTOPIAN: User-Driven Topic Modeling Based on Interactive Nonnegative Matrix Factorization
Choo, J., Lee, C., Reddy, C. K., & Park, H. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2013.212 · Cited by 262
Self-citationNonato, L. G., & Aupetit, M. (2019) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2018.2846735 · Cited by 259
A survey of visual analytics techniques for machine learning
Yuan, J., Chen, C., Yang, W., Liu, M., Xia, J., & Liu, S. (2021) · Computational Visual Media · doi:10.1007/s41095-020-0191-7 · Cited by 258
Metadata
- Authors
- Lee, H., Kihm, J., Choo, J., Stasko, J., & Park, H.
- Venue
- Computer Graphics Forum
- Publisher
- Wiley
- Published
- 2012-06
- Volume
- 31
- Issue
- 3pt3
- Pages
- 1155-1164
- ISSN
- 0167-7055 (ISSN-L)
- 1467-8659
- OpenAlex
- W1991676464
- Cited by
- 160
- References
- 34
- FWCI
- 6.88
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.