메뉴 건너뛰기




Volumn 31, Issue 3 PART 3, 2012, Pages 1155-1164

IVisClustering: An interactive visual document clustering via topic modeling

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; INFORMATION RETRIEVAL; STATISTICS; TREES (MATHEMATICS);

EID: 84875822190     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/j.1467-8659.2012.03108.x     Document Type: Article
Times cited : (145)

References (36)
  • 1
    • 0033536012 scopus 로고    scopus 로고
    • Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays
    • 1
    • [ABN-99] ALON U., BARKAI N., NOTTERMAN D. A., GISH K., YBARRA S., MACK D., LEVINE A. J.: Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays. Proceedings of the National Academy of Sciences of USA 96, 12 (1999), 6745- 6750. 1
    • (1999) Proceedings of the National Academy of Sciences of USA , vol.96 , Issue.12 , pp. 6745-6750
    • Alon, U.1    Barkai, N.2    Notterman, D.A.3    Gish, K.4    Ybarra, S.5    Mack, D.6    Levine, A.J.7
  • 2
    • 36948999941 scopus 로고    scopus 로고
    • University of California, Irvine, School of Information and Computer Sciences 7
    • [AN07] ASUNCION A., NEWMAN D.: UCI machine learning repository. University of California, Irvine, School of Information and Computer Sciences, 2007. 7
    • (2007) UCI Machine Learning Repository
    • Asuncion, A.1    Newman, D.2
  • 5
    • 84880904276 scopus 로고    scopus 로고
    • Interactive clustering of text collections according to a user-specified criterion
    • 2
    • [BRAE07] BEKKERMAN R., RAGHAVAN H., ALLAN J., EGUCHI K.: Interactive clustering of text collections according to a user-specified criterion. In Proceedings of IJCAI-20 (2007), pp. 684-689. 2
    • (2007) Proceedings of IJCAI-20 , pp. 684-689
    • Bekkerman, R.1    Raghavan, H.2    Allan, J.3    Eguchi, K.4
  • 6
    • 33750512945 scopus 로고    scopus 로고
    • Fast and robust fuzzy cmeans clustering algorithms incorporating local information for image segmentation
    • March 1
    • [CCZ07] CAI W., CHEN S., ZHANG D.: Fast and robust fuzzy cmeans clustering algorithms incorporating local information for image segmentation. Pattern Recognition 40 (March 2007), 825- 838. 1
    • (2007) Pattern Recognition , vol.40 , pp. 825-838
    • Cai, W.1    Chen, S.2    Zhang, D.3
  • 7
    • 33745475658 scopus 로고    scopus 로고
    • IVIBRATE: Interactive visualizationbased framework for clustering large datasets
    • 2
    • [CL06] CHEN K., LIU L.: iVIBRATE: Interactive visualizationbased framework for clustering large datasets. ACM Transactions on Information Systems 24, 2 (2006), 245-294. 2
    • (2006) ACM Transactions on Information Systems , vol.24 , Issue.2 , pp. 245-294
    • Chen, K.1    Liu, L.2
  • 9
    • 84879736428 scopus 로고    scopus 로고
    • 3
    • [Clu] Clustify. http://www.cluster-text.com/. 3
    • Clustify
  • 10
    • 0001765146 scopus 로고
    • An efficient algorithm for a complete link method
    • 2
    • [Def77] DEFAYS D.: An efficient algorithm for a complete link method. Comput. J. 20, 4 (1977), 364-366. 2
    • (1977) Comput. J. , vol.20 , Issue.4 , pp. 364-366
    • Defays, D.1
  • 13
    • 0031269184 scopus 로고    scopus 로고
    • On the optimality of the simple bayesian classifier under zero-one loss
    • November 2
    • [DP97] DOMINGOS P., PAZZANI M.: On the optimality of the simple bayesian classifier under zero-one loss. Machine Learning 29 (November 1997), 103-130. 2
    • (1997) Machine Learning , vol.29 , pp. 103-130
    • Domingos, P.1    Pazzani, M.2
  • 15
    • 0006767318 scopus 로고    scopus 로고
    • Navigating clustered graphs using force-directed methods
    • 4
    • [EH00] EADES P., HUANG M. L.: Navigating clustered graphs using force-directed methods. Journal of Graph Algorithms and Applications 4, 3 (2000), 157-181. 4
    • (2000) Journal of Graph Algorithms and Applications , vol.4 , Issue.3 , pp. 157-181
    • Eades, P.1    Huang, M.L.2
  • 18
    • 85022103524 scopus 로고    scopus 로고
    • InfoVis and VAST papers 7
    • [Inf] InfoVis and VAST papers. http://www.cc.gatech. edu/gvu/ii/jigsaw/ datafiles.html. 7
  • 19
    • 77950369345 scopus 로고    scopus 로고
    • Data clustering: 50 years beyond k-means
    • 1
    • [Jai10] JAIN A. K.: Data clustering: 50 years beyond k-means. Pattern Recognition Letters 31, 8 (2010), 651 - 666. 1
    • (2010) Pattern Recognition Letters , vol.31 , Issue.8 , pp. 651-666
    • Jain, A.K.1
  • 21
    • 0013006741 scopus 로고    scopus 로고
    • Star coordinates: A multi-dimensional visualization technique with uniform treatment of dimensions
    • Late Breaking Hot Topics 2
    • [Kan00] KANDOGAN E.: Star coordinates: A multi-dimensional visualization technique with uniform treatment of dimensions. In In Proceedings of the IEEE Information Visualization Symposium, Late Breaking Hot Topics (2000), pp. 9-12. 2
    • (2000) Proceedings of the IEEE Information Visualization Symposium , pp. 9-12
    • Kandogan, E.1
  • 22
    • 84863012243 scopus 로고    scopus 로고
    • Fast nonnegative matrix factorization: An active-set-like method and comparisons
    • 2 9
    • [KP11] KIM J., PARK H.: Fast nonnegative matrix factorization: An active-set-like method and comparisons. SIAM Journal on Scientific Computing 33, 6 (2011), 3261-3281. 2, 9
    • (2011) SIAM Journal on Scientific Computing , vol.33 , Issue.6 , pp. 3261-3281
    • Kim, J.1    Park, H.2
  • 23
    • 0002719797 scopus 로고
    • The Hungarian method for the assignment problem
    • 6
    • [Kuh55] KUHN H. W.: The Hungarian method for the assignment problem. Naval Research Logistic Quarterly 2 (1955), 83-97. 6
    • (1955) Naval Research Logistic Quarterly , vol.2 , pp. 83-97
    • Kuhn, H.W.1
  • 24
    • 61549106158 scopus 로고    scopus 로고
    • Sage Publications, Inc. Thousand Oaks, CA, USA, 1
    • [KY08] KNOKE D., YANG S.: Social Network Analysis. Sage Publications, Inc. Thousand Oaks, CA, USA, 2008. 1
    • (2008) Social Network Analysis
    • Knoke, D.1    Yang, S.2
  • 25
    • 84879734947 scopus 로고    scopus 로고
    • Lingo3G 3
    • [Lin] Lingo3G. http://carrotsearch.com/ lingo3g-overview.html. 3
  • 26
    • 0003918928 scopus 로고    scopus 로고
    • SIMS, University of California at Berkeley, CA, US 1
    • [LV03] LYMAN P., VARIAN H. R.: How Much Information? SIMS, University of California at Berkeley, CA, US. http:// www.sims.berkeley.edu/how-much-info- 2003, 2003. 1
    • (2003) How Much Information?
    • Lyman, P.1    Varian, H.R.2
  • 30
    • 0002663098 scopus 로고
    • SLINK: An optimally efficient algorithm for the single-link cluster method
    • January 2
    • [Sib73] SIBSON R.: SLINK: An optimally efficient algorithm for the single-link cluster method. The Computer Journal 16, 1 (January 1973), 30-34. 2
    • (1973) The Computer Journal , vol.16 , Issue.1 , pp. 30-34
    • Sibson, R.1
  • 33
    • 84996229696 scopus 로고    scopus 로고
    • A rank-by-feature framework for interactive exploration of multidimensional data
    • July 2
    • [SS05] SEO J., SHNEIDERMAN B.: A rank-by-feature framework for interactive exploration of multidimensional data. Information Visualization 4 (July 2005), 96-113. 2
    • (2005) Information Visualization , vol.4 , pp. 96-113
    • Seo, J.1    Shneiderman, B.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.