{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:41:59Z","timestamp":1761662519807},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,7,6]],"date-time":"2007-07-06T00:00:00Z","timestamp":1183680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2007,10,23]]},"DOI":"10.1007\/s10618-007-0072-z","type":"journal-article","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T18:56:29Z","timestamp":1183575389000},"page":"321-348","source":"Crossref","is-referenced-by-count":39,"title":["CrossClus: user-guided multi-relational clustering"],"prefix":"10.1007","volume":"15","author":[{"given":"Xiaoxin","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,6]]},"reference":[{"key":"72_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Yu PS (2000) Finding generalized projected clusters in high dimensional spaces. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data, Dallas, TX, pp 70\u201381","DOI":"10.1145\/342009.335383"},{"key":"72_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Procopiuc C, Wolf JL, Yu PS, Park JS (1999) Fast algorithms for projected clustering. In: Proceedings of the 1999 ACM SIGMOD international conference on management of data, Philadelphia, PA, pp 61\u201372","DOI":"10.1145\/304182.304188"},{"key":"72_CR3","doi-asserted-by":"crossref","unstructured":"Bilenko M, Basu S, Mooney RJ (2004) Integrating constraints and metric learning in semi-supervised clustering. In: Proceedings of the 2004 international conference on machine learning, Alberta, Canada, pp 81\u201388","DOI":"10.1145\/1015330.1015360"},{"key":"72_CR4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1613\/jair.924","volume":"16","author":"H Blockeel","year":"2002","unstructured":"Blockeel H, Dehaspe L and Demoen B (2002). Improving the efficiency of inductive logic programming through the use of query packs. J Artif Intell Res 16: 135\u2013166","journal-title":"J Artif Intell Res"},{"key":"72_CR5","doi-asserted-by":"crossref","unstructured":"Cheeseman P et\u00a0al (1988) AutoClass: a Bayesian classfication system. In: Proceedings of the 1988 international conference on machine learning, Alberta, Ann Arbor, MI, pp 54\u201364","DOI":"10.1016\/B978-0-934613-64-4.50011-6"},{"key":"72_CR6","unstructured":"DBLP Bibliography. http:\/\/www.informatik.uni-trier.de\/\u223cley\/db\/"},{"key":"72_CR7","doi-asserted-by":"crossref","unstructured":"Ding C, Peng H (2003) Minimum redundancy feature selection from microarray gene expression data. In: Proceedings of the 2003 IEEE computer society bioinformatics conference, Stanford, CA, pp 523\u2013529","DOI":"10.1109\/CSB.2003.1227396"},{"key":"72_CR8","first-page":"845","volume":"5","author":"JG Dy","year":"2004","unstructured":"Dy JG and Brodley CE (2004). Feature selection for unsupervised learning. J Mach Learn Res 5: 845\u2013889","journal-title":"J Mach Learn Res"},{"key":"72_CR9","unstructured":"Emde W, Wettschereck D (1996) Relational instance-based learning. In: Proceedings of the 1996 international conference on machine learning, Bari, Italy, pp 122\u2013130"},{"key":"72_CR10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/B:MACH.0000039777.23772.30","volume":"57","author":"T G\u00e4rtner","year":"2004","unstructured":"G\u00e4rtner T, Lloyd JW and Flach PA (2004). Kernels and distances for structured data. Mach Learn 57: 205\u2013232","journal-title":"Mach Learn"},{"key":"72_CR11","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon I and Elisseeff A (2003). An introduction to variable and feature selection. J Mach Learn Res 3: 1157\u20131182","journal-title":"J Mach Learn Res"},{"key":"72_CR12","unstructured":"Hall MA (2000) Correlation-based feature selection for discrete and numeric class machine learning. In: Proceedings of the 2000 international conference on machine learning, Stanford, CA, pp 359\u2013366"},{"key":"72_CR13","unstructured":"Hristidis V, Papakonstantinou Y (2002) DISCOVER: keyword search in relational databases. In: Proceedings of the 2002 international conference on very large data bases, Hong Kong, China, pp 670\u2013681"},{"key":"72_CR14","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN and Flynn PJ (1999). Data clustering: a review. ACM Comput Surv 31: 264\u2013323","journal-title":"ACM Comput Surv"},{"key":"72_CR15","doi-asserted-by":"crossref","unstructured":"Kaufman L, Rousseeuw PJ (1990) Finding groups in data: an introduction to cluster analysis. John Wiley and Sons","DOI":"10.1002\/9780470316801"},{"key":"72_CR16","unstructured":"Klein D, Kamvar SD, Manning C (2002) From instance-level constraints to space-level constraints: making the most of prior knowledge in data clustering. In: Proceedings of the 2002 international conference on machine learning, Sydney, Australia, pp 307\u2013314"},{"key":"72_CR17","doi-asserted-by":"crossref","unstructured":"Kirsten M, Wrobel S (1998) Relational distance-based clustering. In: Proceedings of the 1998 international Workshop on inductive logic programming, Madison, WI, pp 261\u2013270","DOI":"10.1007\/BFb0027330"},{"key":"72_CR18","doi-asserted-by":"crossref","unstructured":"Kirsten M, Wrobel S (2000) Extending K-means clustering to first-order representations. In: Proceedings of the 2000 international workshop on inductive logic programming, London, UK, pp 112\u2013129","DOI":"10.1007\/3-540-44960-4_7"},{"key":"72_CR19","unstructured":"MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the 1967 Berkeley symposium on mathematics, statistics and probability, Berkeley, CA, pp 281\u2013298"},{"key":"72_CR20","unstructured":"Mitchell TM (1997) Machine learning. McGraw Hill"},{"key":"72_CR21","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/34.990133","volume":"24","author":"P Mitra","year":"2002","unstructured":"Mitra P, Murthy CA and Pal SK (2002). Unsupervised feature selection using feature similarity. IEEE Trans Pattern Anal Mach Intell 24: 301\u2013312","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"72_CR22","unstructured":"Ng RT, Han J (1994) Efficient and effective clustering methods for spatial data mining. In: Proceedings of the 1994 international conference on very large data bases, Santiago de Chile, Chile, pp 144\u2013155"},{"key":"72_CR23","doi-asserted-by":"crossref","unstructured":"Quinlan JR, Cameron-Jones RM (1993) FOIL: a midterm report. In: Proceedings of the 1993 European conference on machine learning, Vienna, Austria, pp 3\u201320","DOI":"10.1007\/3-540-56602-3_124"},{"key":"72_CR24","unstructured":"Tan P-N, Steinbach M, Kumar W (2005) Introdution to data mining. Addison-Wesley"},{"key":"72_CR25","unstructured":"Wagstaff K, Cardie C, Rogers S, Schroedl S (2001) Constrained k-means clustering with background knowledge. In: Proceedings of the 2001 international conference on machine learning, Williamstown, MA, pp 577\u2013584"},{"key":"72_CR26","unstructured":"Xing EP, Ng AY, Jordan MI, Russell S (2002) Distance metric learning, with application to clustering with side-information. In: Proceedings of the 2002 neural information processing systems, Vancouver, Canada, pp 505\u2013512"},{"key":"72_CR27","unstructured":"Yin X, Han J, Yang J, Yu PS (2004) CrossMine: efficient classification across multiple database relations. In: Proceedings of the 2004 international conference on data engineering, Boston, MA, pp 399\u2013411"},{"key":"72_CR28","doi-asserted-by":"crossref","unstructured":"Yin X, Han J, Yu PS (2005) Cross-relational clustering with user\u2019s guidance. In: Proceedings of the 2005 ACM SIGKDD international conference on knowledge discovery and data mining, Chicago, IL, pp 344\u2013353","DOI":"10.1145\/1081870.1081910"},{"key":"72_CR29","doi-asserted-by":"crossref","unstructured":"Zhang T, Ramakrishnan R, Livny M (1996) BIRCH: an efficient data clustering method for very large databases. In: Proceedings of the 1996 ACM SIGMOD international conference on management of data, Montreal, Canada, pp 103\u2013114","DOI":"10.1145\/233269.233324"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-007-0072-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-007-0072-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-007-0072-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:29:39Z","timestamp":1559230179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-007-0072-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,6]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,10,23]]}},"alternative-id":["72"],"URL":"https:\/\/doi.org\/10.1007\/s10618-007-0072-z","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,6]]}}}