{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:42:01Z","timestamp":1754109721086},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T00:00:00Z","timestamp":1357689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10115-012-0609-3","type":"journal-article","created":{"date-parts":[[2013,1,8]],"date-time":"2013-01-08T16:33:20Z","timestamp":1357662800000},"page":"61-88","source":"Crossref","is-referenced-by-count":11,"title":["High-dimensional clustering: a clique-based hypergraph partitioning framework"],"prefix":"10.1007","volume":"39","author":[{"given":"Tianming","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuanren","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sam Yuan","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,9]]},"reference":[{"key":"609_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami AN (1993) Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD conference on management of data, pp 207\u2013216","DOI":"10.1145\/170036.170072"},{"issue":"6","key":"609_CR2","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY (1998) An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J ACM 45(6):891\u2013923","journal-title":"J ACM"},{"key":"609_CR3","volume-title":"Modern information retrieval","author":"R Baeza-Yates","year":"1999","unstructured":"Baeza-Yates R, Ribeiro-Neto B (1999) Modern information retrieval. Addison-Wesley, Reading"},{"issue":"1\u20134","key":"609_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0020-0255(02)00208-6","volume":"146","author":"S Bandyopadhyay","year":"2002","unstructured":"Bandyopadhyay S, Maulik U (2002) An evolutionary technique based on k-means algorithm for optimal clustering in $$R^N$$ . Inf Sci 146(1\u20134):221\u2013237","journal-title":"Inf Sci"},{"key":"609_CR5","unstructured":"Cheeseman P, Stutz J (1996) Bayesian classification (AutoClass): theory and results. In: Advances in knowledge discovery and data mining, pp 153\u2013180"},{"issue":"3","key":"609_CR6","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1007\/s10115-010-0364-2","volume":"28","author":"C Chen","year":"2011","unstructured":"Chen C, Tseng F, Liang T (2011) An integration of fuzzy association rules and wordnet for document clustering. Knowl Inf Syst 28(3):687\u2013708","journal-title":"Knowl Inf Syst"},{"key":"609_CR7","doi-asserted-by":"crossref","unstructured":"Ertoz L, Steinbach M, Kumar V (2003) Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data. In: Proceedings of the 3rd SIAM international conference on data mining, pp 47\u201358","DOI":"10.1137\/1.9781611972733.5"},{"issue":"2","key":"609_CR8","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10115-010-0370-4","volume":"28","author":"S Fodeh","year":"2011","unstructured":"Fodeh S, Punch B, Tan P (2011) On ontology-driven document clustering using core semantic features. Knowl Inf Syst 28(2):395\u2013421","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"609_CR9","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.ins.2011.07.048","volume":"184","author":"SL France","year":"2012","unstructured":"France SL, Carroll JD, Xiong H (2012) Distance metrics for high dimensional nearest neighborhood recovery: compression and normalization. Inf Sci 184(1):92\u2013110","journal-title":"Inf Sci"},{"issue":"1","key":"609_CR10","first-page":"15","volume":"21","author":"E-H Han","year":"1998","unstructured":"Han E-H, Karypis G, Kumar V, Mobasher B (1998) Hypergraph based clustering in high-dimensional data sets: a summary of results. IEEE Data Eng Bull 21(1):15\u201322","journal-title":"IEEE Data Eng Bull"},{"issue":"4","key":"609_CR11","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s10115-006-0017-7","volume":"10","author":"T Hu","year":"2006","unstructured":"Hu T, Sung SY (2006) Finding centroid clusterings with entropy-based criteria. Knowl Inf Syst 10(4):505\u2013514","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"609_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.ins.2007.08.006","volume":"178","author":"T Hu","year":"2008","unstructured":"Hu T, Sung SY, Xiong H, Fu Q (2008) Discovery of maximum length frequent itemsets. Inf Sci 178(1):69\u201387","journal-title":"Inf Sci"},{"issue":"1","key":"609_CR13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1142\/S0218213008003790","volume":"17","author":"T Hu","year":"2008","unstructured":"Hu T, Tan CL, Tang Y, Sung SY, Xiong H, Qu C (2008) Co-clustering bipartite with pattern preservation for topic extraction. Int J Artif Intell Tools 17(1):87\u2013107","journal-title":"Int J Artif Intell Tools"},{"issue":"3","key":"609_CR14","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1016\/j.ins.2006.07.029","volume":"177","author":"Y Huang","year":"2007","unstructured":"Huang Y, Xiong H, Wu W, Deng P, Zhang Z (2007) Mining maximal hyperclique pattern: a hybrid search strategy. Inf Sci 177(3):703\u2013721","journal-title":"Inf Sci"},{"issue":"3","key":"609_CR15","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surveys 31(3):264\u2013323","journal-title":"ACM Comput Surveys"},{"issue":"3","key":"609_CR16","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s10115-011-0412-6","volume":"31","author":"A Kalogeratos","year":"2012","unstructured":"Kalogeratos A, Likas A (2012) Text document clustering using global term context vectors. Knowl Inf Syst 31(3):455\u2013474","journal-title":"Knowl Inf Syst"},{"key":"609_CR17","unstructured":"Karypis G (2003) CLUTO\u2014software for clustering high-dimensional datasets. http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/cluto"},{"key":"609_CR18","doi-asserted-by":"crossref","unstructured":"Karypis G, Aggarwal R, Kumar V, Shekhar S (1997) Multilevel hypergraph partitioning: applications in VLSI domain. In: Proceedings of the 34th conference on design automation, pp 526\u2013529","DOI":"10.1109\/DAC.1997.597203"},{"key":"609_CR19","doi-asserted-by":"crossref","unstructured":"Korn F, Muthukrishnan S (2000) Influence sets based on reverse nearest neighbor queries. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data, pp 201\u2013212","DOI":"10.1145\/342009.335415"},{"issue":"3","key":"609_CR20","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10115-006-0002-1","volume":"10","author":"C Leung","year":"2006","unstructured":"Leung C, Chan S, Chung F (2006) A collaborative filtering framework based on fuzzy association rules and multiple-level similarity. Knowl Inf Syst 10(3):357\u2013381","journal-title":"Knowl Inf Syst"},{"issue":"1\u20132","key":"609_CR21","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ijar.2004.11.005","volume":"40","author":"TY Lin","year":"2005","unstructured":"Lin TY, Chiang I-J (2005) A simplicial complex, a hypergraph, structure in the latent semantic space of document clustering. Int J Approx Reason 40(1\u20132):55\u201380","journal-title":"Int J Approx Reason"},{"key":"609_CR22","doi-asserted-by":"crossref","unstructured":"Liu C, Hu T, Ge Y, Xiong H (2012) Which distance metric is right: An evolutionary k-means view. In: Proceedings of the 12th SIAM international conference on data mining, pp 907\u2013918","DOI":"10.1137\/1.9781611972825.78"},{"issue":"3","key":"609_CR23","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10115-010-0299-7","volume":"27","author":"X Ni","year":"2011","unstructured":"Ni X, Quan X, Lu Z, Liu W, Hua B (2011) Short text clustering by finding core terms. Knowl Inf Syst 27(3):345\u2013365","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"609_CR24","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1023\/B:DAMI.0000026903.59233.2a","volume":"9","author":"MM Ozdal","year":"2004","unstructured":"Ozdal MM, Aykanat C (2004) Hypergraph models and algorithms for data-pattern-based clustering. Data Min Knowl Discov 9(1):29\u201357","journal-title":"Data Min Knowl Discov"},{"issue":"3","key":"609_CR25","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10115-011-0409-1","volume":"31","author":"D Rajpathak","year":"2012","unstructured":"Rajpathak D, Chougule R, Bandyopadhyay P (2012) A domain-specific decision support system for knowledge discovery using association and text mining. Knowl Inf Syst 31(3):405\u2013432","journal-title":"Knowl Inf Syst"},{"key":"609_CR26","unstructured":"Rennie JD, Shih L, Teevan J, Karger DR (2003) Tackling the poor assumptions of naive bayes text classifiers. In: Proceedings of the 20th international conference on machine learning, pp 616\u2013623"},{"key":"609_CR27","unstructured":"Steinbach M, Karypis G, Kumar V (2000) A comparison of document clustering techniques. In: KDD workshop on text mining"},{"key":"609_CR28","doi-asserted-by":"crossref","unstructured":"Vadapalli S, Valluri SR, Karlapalem K (2006) A simple yet effective data clustering algorithm. In: Proceedings of the 6th IEEE international conference on data mining, pp 1108\u20131112","DOI":"10.1109\/ICDM.2006.9"},{"issue":"3","key":"609_CR29","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/TKDE.2006.38","volume":"18","author":"C Xia","year":"2006","unstructured":"Xia C, Hsu W, Lee ML, Ooi BC (2006) BORDER: Efficient computation of boundary points. IEEE Trans Knowl Data Eng 18(3):289\u2013303","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"609_CR30","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10618-006-0043-9","volume":"13","author":"H Xiong","year":"2006","unstructured":"Xiong H, Tan P-N, Kumar V (2006) Hyperclique pattern discovery. Data Min Knowl Discov 13(2):219\u2013242","journal-title":"Data Min Knowl Discov"},{"issue":"3","key":"609_CR31","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/B:MACH.0000027785.44527.d6","volume":"55","author":"Y Zhao","year":"2004","unstructured":"Zhao Y, Karypis G (2004) Empirical and theoretical comparisons of selected criterion functions for document clustering. Mach Learn 55(3):311\u2013331","journal-title":"Mach Learn"},{"issue":"2","key":"609_CR32","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10618-005-0361-3","volume":"10","author":"Y Zhao","year":"2005","unstructured":"Zhao Y, Karypis G (2005) Hierarchical clustering algorithms for document datasets. Data Min Knowl Discov 10(2):141\u2013168","journal-title":"Data Min Knowl Discov"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0609-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-012-0609-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0609-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T02:37:23Z","timestamp":1562553443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-012-0609-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,9]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["609"],"URL":"https:\/\/doi.org\/10.1007\/s10115-012-0609-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,9]]}}}