메뉴 건너뛰기




Volumn 67, Issue 1, 2016, Pages 106-133

Descriptive document clustering via discriminant learning in a co-embedded space of multilevel similarities

Author keywords

information retrieval; natural language processing; text mining

Indexed keywords

CLUSTER ANALYSIS; DATA MINING; NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 84975089751     PISSN: 23301635     EISSN: 23301643     Source Type: Journal    
DOI: 10.1002/asi.23374     Document Type: Article
Times cited : (17)

References (79)
  • 2
    • 77954145064 scopus 로고    scopus 로고
    • Hierarchical k-means: An algorithm for centroids initialization for k-means
    • Arai, K., & Ridho, B.A. (2007). Hierarchical k-means: An algorithm for centroids initialization for k-means. Reports of the Faculty of Science and Engineering, 36(1), 25–31.
    • (2007) Reports of the Faculty of Science and Engineering , vol.36 , Issue.1 , pp. 25-31
    • Arai, K.1    Ridho, B.A.2
  • 3
    • 0242452660 scopus 로고    scopus 로고
    • Baeza-Yates, R.A., Ribeiro-Neto, B.A., (Eds.). (, Boston, MA, USA, ACM Press, Addison-Wesley
    • Baeza-Yates, R.A., & Ribeiro-Neto, B.A. (Eds.). (1999). Modern information retrieval. Boston, MA, USA: ACM Press, Addison-Wesley.
    • (1999) Modern information retrieval
  • 7
    • 0042378381 scopus 로고    scopus 로고
    • Laplacian eigenmaps for dimensionality reduction and data representation
    • Belkin, M., & Niyogi, P. (2003). Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6), 1373–1396.
    • (2003) Neural Computation , vol.15 , Issue.6 , pp. 1373-1396
    • Belkin, M.1    Niyogi, P.2
  • 13
    • 80755133615 scopus 로고    scopus 로고
    • Classification and visualization of the social science network by the minimum span clustering method
    • Chang, Y.F., & Chen, C.-M. (2011). Classification and visualization of the social science network by the minimum span clustering method. Journal of the American Society for Information Science and Technology, 62(12), 2404–2413.
    • (2011) Journal of the American Society for Information Science and Technology , vol.62 , Issue.12 , pp. 2404-2413
    • Chang, Y.F.1    Chen, C.-M.2
  • 14
    • 0036375425 scopus 로고    scopus 로고
    • Generalized association plots: Information visualization via iteratively generated correlation matrices
    • Chen, C.H. (2002). Generalized association plots: Information visualization via iteratively generated correlation matrices. Statistica Sinica, 12(1), 7–29.
    • (2002) Statistica Sinica , vol.12 , Issue.1 , pp. 7-29
    • Chen, C.H.1
  • 21
    • 0031269184 scopus 로고    scopus 로고
    • On the optimality of the simple bayesian classifier under zero-one loss
    • Domingos, P., & Pazzani, M. (1997). On the optimality of the simple bayesian classifier under zero-one loss. Machine Learning, 29, 103–130.
    • (1997) Machine Learning , vol.29 , pp. 103-130
    • Domingos, P.1    Pazzani, M.2
  • 22
    • 23744454242 scopus 로고    scopus 로고
    • Amsterdam National Research Institute for Mathematics and Computer Science in the Netherlands
    • Dongen, S. (2000). A Cluster Algorithm for Graphs (Tech. Rep. No. INS-R0010). Amsterdam: National Research Institute for Mathematics and Computer Science in the Netherlands.
    • (2000) A Cluster Algorithm for Graphs (Tech. Rep. No. INS-R0010)
    • Dongen, S.1
  • 24
    • 10844291594 scopus 로고    scopus 로고
    • The most influential paper gerard salton never wrote
    • Dubin, D. (2004). The most influential paper gerard salton never wrote. Library Trends, 52(4), 748–764.
    • (2004) Library Trends , vol.52 , Issue.4 , pp. 748-764
    • Dubin, D.1
  • 26
    • 0000802374 scopus 로고
    • The approximation of one matrix by another of lower rank
    • Eckart, C., & Young, G. (1936). The approximation of one matrix by another of lower rank. Psychometrika, 1(3), 211–218.
    • (1936) Psychometrika , vol.1 , Issue.3 , pp. 211-218
    • Eckart, C.1    Young, G.2
  • 27
    • 78650633610 scopus 로고    scopus 로고
    • Automatic recognition of multi-word terms: The c-value/nc-value method
    • Frantzi, K., Ananiadou, S., & Mima, H. (2000). Automatic recognition of multi-word terms: The c-value/nc-value method. International Journal of Digital Libraries, 3(2), 117–132.
    • (2000) International Journal of Digital Libraries , vol.3 , Issue.2 , pp. 117-132
    • Frantzi, K.1    Ananiadou, S.2    Mima, H.3
  • 34
    • 77950369345 scopus 로고    scopus 로고
    • Data clustering: 50 years beyond k-means
    • Jain, A.K. (2010). Data clustering: 50 years beyond k-means. Pattern Recognition Letters, 31(8), 651–666.
    • (2010) Pattern Recognition Letters , vol.31 , Issue.8 , pp. 651-666
    • Jain, A.K.1
  • 37
    • 79961205792 scopus 로고    scopus 로고
    • A survey of document clustering algorithms with topic discovery
    • Jayabharathy, J., Kanmani, S., & Parveen, A.A. (2011). A survey of document clustering algorithms with topic discovery. Journal of Computing, 3(2), 21–27.
    • (2011) Journal of Computing , vol.3 , Issue.2 , pp. 21-27
    • Jayabharathy, J.1    Kanmani, S.2    Parveen, A.A.3
  • 40
    • 0036603927 scopus 로고    scopus 로고
    • Automatic extraction of document key phrases for use in digital libraries: Evaluation and applications
    • Jones, S., & Paynter, G.W. (2002). Automatic extraction of document key phrases for use in digital libraries: Evaluation and applications. Journal of the American Society for Information Science and Technology, 53(8), 653–677.
    • (2002) Journal of the American Society for Information Science and Technology , vol.53 , Issue.8 , pp. 653-677
    • Jones, S.1    Paynter, G.W.2
  • 41
    • 0025489075 scopus 로고
    • The self-organizing map
    • Kohonen, T. (1990). The self-organizing map. Proceedings of the IEEE, 78(9), 1464–1480.
    • (1990) Proceedings of the IEEE , vol.78 , Issue.9 , pp. 1464-1480
    • Kohonen, T.1
  • 42
    • 84860431065 scopus 로고    scopus 로고
    • ASCOT: A text mining-based web-service for efficient search and assisted creation of clinical trials
    • Korkontzelos, I., Mu, T., & Ananiadou, S. (2012). ASCOT: A text mining-based web-service for efficient search and assisted creation of clinical trials. BMC Medical Informatics and Decision Making, 12(Suppl. 1), S3.
    • (2012) BMC Medical Informatics and Decision Making , vol.12 , pp. 3
    • Korkontzelos, I.1    Mu, T.2    Ananiadou, S.3
  • 44
    • 77953538302 scopus 로고    scopus 로고
    • A generalized model of relational similarity
    • Kovács, B. (2010). A generalized model of relational similarity. Social Networks, 32(3), 197–211.
    • (2010) Social Networks , vol.32 , Issue.3 , pp. 197-211
    • Kovács, B.1
  • 49
    • 84884990701 scopus 로고    scopus 로고
    • Discovering low-rank shared concept space for adapting text mining models
    • Lam, W., Tsang, I., & Wong, T. (2013). Discovering low-rank shared concept space for adapting text mining models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(6), 1284–1297. doi: 10.1109/TPAMI.2012.243
    • (2013) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.35 , Issue.6 , pp. 1284-1297
    • Lam, W.1    Tsang, I.2    Wong, T.3
  • 51
    • 36049012687 scopus 로고    scopus 로고
    • Text Document Clustering Based on Frequent Word Meaning Sequences
    • Li, Y., Chung, S.M., & Holt, J.D. (2008a). Text Document Clustering Based on Frequent Word Meaning Sequences. Data & Knowledge Engineering, 64(1), 381–404.
    • (2008) Data & Knowledge Engineering , vol.64 , Issue.1 , pp. 381-404
    • Li, Y.1    Chung, S.M.2    Holt, J.D.3
  • 52
    • 57949101466 scopus 로고    scopus 로고
    • A new descriptive clustering algorithm based on nonnegative matrix factorization
    • In, Hangzhou, China, IEEE
    • Li, Z., Peng, H., & Wu, X. (2008b). A new descriptive clustering algorithm based on nonnegative matrix factorization. In Proceedings of the IEEE Int'l Conference on Granular Computing, GRC (pp. 407–412). Hangzhou, China: IEEE.
    • (2008) Proceedings of the IEEE Int'l Conference on Granular Computing, GRC , pp. 407-412
    • Li, Z.1    Peng, H.2    Wu, X.3
  • 53
    • 34548583274 scopus 로고    scopus 로고
    • A tutorial on spectral clustering
    • Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17(4), 395–416.
    • (2007) Statistics and Computing , vol.17 , Issue.4 , pp. 395-416
    • Luxburg, U.1
  • 55
    • 84883186360 scopus 로고    scopus 로고
    • Automatic generation of co-embeddings from relational data with adaptive shaping
    • Mu, T., & Goulermas, J.Y. (2013). Automatic generation of co-embeddings from relational data with adaptive shaping. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(10), 2340–2356.
    • (2013) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.35 , Issue.10 , pp. 2340-2356
    • Mu, T.1    Goulermas, J.Y.2
  • 59
    • 33745838159 scopus 로고    scopus 로고
    • Improving quality of search results clustering with approximate matrix factorisations
    • Osiński, S. (2006). Improving quality of search results clustering with approximate matrix factorisations. Advances in Information Retrieval, Lecture Notes in Computer Science, 3969, 167–178.
    • (2006) Advances in Information Retrieval, Lecture Notes in Computer Science , vol.3969 , pp. 167-178
    • Osiński, S.1
  • 60
    • 20844452619 scopus 로고    scopus 로고
    • A concept-driven algorithm for clustering search results
    • Osiński, S., & Weiss, D. (2005). A concept-driven algorithm for clustering search results. IEEE Intelligent Systems, 20(3), 48–54.
    • (2005) IEEE Intelligent Systems , vol.20 , Issue.3 , pp. 48-54
    • Osiński, S.1    Weiss, D.2
  • 62
    • 2342426727 scopus 로고    scopus 로고
    • Gaussian mixture clustering and imputation of microarray data
    • Ouyang, M., Welsh, W.J., & Georgopoulos, P. (2004). Gaussian mixture clustering and imputation of microarray data. Bioinformatics (Oxford, England), 20(6), 917–992.
    • (2004) Bioinformatics (Oxford, England) , vol.20 , Issue.6 , pp. 917-992
    • Ouyang, M.1    Welsh, W.J.2    Georgopoulos, P.3
  • 65
    • 45149083668 scopus 로고    scopus 로고
    • Extending k-means with the description comes first approach
    • Stefanowski, J., & Weiss, D. (2007). Extending k-means with the description comes first approach. Control and Cybernetics, 36(4), 1010–1035.
    • (2007) Control and Cybernetics , vol.36 , Issue.4 , pp. 1010-1035
    • Stefanowski, J.1    Weiss, D.2
  • 68
    • 83255176865 scopus 로고    scopus 로고
    • Applications of text mining within systematic reviews
    • Thomas, J., McNaught, J., & Ananiadou, S. (2011). Applications of text mining within systematic reviews. Research Synthesis Methods, 2(1), 1–14.
    • (2011) Research Synthesis Methods , vol.2 , Issue.1 , pp. 1-14
    • Thomas, J.1    McNaught, J.2    Ananiadou, S.3
  • 69
    • 84950351930 scopus 로고
    • Multidimensional scaling: I. theory and method
    • Torgerson, W.S. (1952). Multidimensional scaling: I. theory and method. Journal Psychometrika, 17(4), 401–419.
    • (1952) Journal Psychometrika , vol.17 , Issue.4 , pp. 401-419
    • Torgerson, W.S.1
  • 71
    • 70449529515 scopus 로고    scopus 로고
    • Generic title labeling for clustered documents
    • Tseng, Y. (2010). Generic title labeling for clustered documents. Expert Systems with Applications, 37(3), 2247–2254.
    • (2010) Expert Systems with Applications , vol.37 , Issue.3 , pp. 2247-2254
    • Tseng, Y.1
  • 75
    • 16444383160 scopus 로고    scopus 로고
    • Survey of clustering algorithms
    • Xu, R. (2005). Survey of clustering algorithms. IEEE Transactions on Neural Networks, 16(3), 645–678.
    • (2005) IEEE Transactions on Neural Networks , vol.16 , Issue.3 , pp. 645-678
    • Xu, R.1


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