{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T05:55:14Z","timestamp":1713938114488},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,1,12]],"date-time":"2014-01-12T00:00:00Z","timestamp":1389484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s12065-013-0103-1","type":"journal-article","created":{"date-parts":[[2014,1,11]],"date-time":"2014-01-11T05:21:15Z","timestamp":1389417675000},"page":"229-256","source":"Crossref","is-referenced-by-count":4,"title":["On evolutionary subspace clustering with symbiosis"],"prefix":"10.1007","volume":"6","author":[{"given":"Ali","family":"Vahdat","sequence":"first","affiliation":[]},{"given":"Malcolm I.","family":"Heywood","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,12]]},"reference":[{"key":"103_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Wolf JL, Yu Philip S, Procopiuc Cecilia, Park Jong Soo (1999) Fast algorithms for projected clustering. In ACM SIGMOD International conference on management of data, pp 61\u201372. ACM","DOI":"10.1145\/304181.304188"},{"key":"103_CR2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/276305.276314","volume":"27","author":"R Agrawal","year":"1988","unstructured":"Agrawal R, Gehrke J, Gunopulos D, Raghavan P (1988) Automatic subspace clustering of high dimensional data for data mining applications. SIGMOD Rec 27:94\u2013105","journal-title":"SIGMOD Rec"},{"key":"103_CR3","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In ACM International conference on very large data bases, pp 487\u2013499"},{"key":"103_CR4","unstructured":"Assent I, Krieger R, Steffens A, Seidl T (2006) A novel biology inspired model for evolutionary subspace clustering. In Proceedings. Annual symposium on nature inspired smart information systems (NiSIS)"},{"key":"103_CR5","doi-asserted-by":"crossref","unstructured":"Bacquet C, Zincir-Heywood AN, Heywood MI (2011) Genetic optimization and hierarchical clustering applied to encrypted traffic identification. In IEEE symposium on computational intelligence in cyber security, pp 194\u2013201","DOI":"10.1109\/CICYBS.2011.5949391"},{"key":"103_CR6","doi-asserted-by":"crossref","unstructured":"Boudjeloud-Assala L, Blansch\u00e9 A (2012) Iterative evolutionary subspace clustering. In International Conference on neural information processing (ICONIP), pp 424\u2013431. Springer","DOI":"10.1007\/978-3-642-34475-6_51"},{"key":"103_CR7","volume-title":"The major transitions in evolution revisited. The Vienna series in Theoretical Biology","author":"B Calcott","year":"2001","unstructured":"Calcott B, Sterelny K, Szathm\u00e1ry E (2001) The major transitions in evolution revisited. The Vienna series in theoretical biology. MIT Press, Cambridge"},{"key":"103_CR8","doi-asserted-by":"crossref","unstructured":"Cho H, Dhillon IS, Guan Y, Sra S (2004) Minimum sum-squared residue co-clustering of gene expression data. In SIAM International conference on data mining","DOI":"10.1137\/1.9781611972740.11"},{"issue":"2","key":"103_CR9","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"Kalyanmoy Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan TAMT (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evolut Comput"},{"issue":"1","key":"103_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"Arthur P Dempster","year":"1977","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the em algorithm. J R Stat Soc Series B (Methodological) 39(1):1\u201338","journal-title":"J R Stat Soc Series B (Methodological)"},{"key":"103_CR11","doi-asserted-by":"crossref","unstructured":"Fern XZ, Brodley CE (2004) Solving cluster ensemble problems by bipartite graph partitioning. In Proceedings of the 21st international conference on Machine learning, pp 36\u2013 ACM","DOI":"10.1145\/1015330.1015414"},{"issue":"1","key":"103_CR12","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"Mark Hall","year":"2009","unstructured":"Hall M, Frank E, Holmes G, Pfahringer B, Reutemann P, Witten IH (2009) The weka data mining software: an update. SIGKDD Explor 11(1):10\u201318","journal-title":"SIGKDD Explor"},{"issue":"1","key":"103_CR13","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/TEVC.2006.877146","volume":"11","author":"Julia Handl","year":"2007","unstructured":"Handl J, Knowles J (2007) An evolutionary approach to multiobjective clustering. IEEE Trans Evolut Comput 11(1):56\u201376","journal-title":"IEEE Trans Evolut Comput"},{"issue":"2","key":"103_CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TSMCC.2008.2007252","volume":"39","author":"Eduardo R Hruschka","year":"2009","unstructured":"Hruschka ER, Campello BRJG, Freitas AA, De Carvalho APLF (2009) A survey of evolutionary algorithms for clustering. IEEE Trans Syst, Man, Cybern: Part C 39(2):133\u2013155","journal-title":"IEEE Trans Syst, Man, Cybern: Part C"},{"issue":"5","key":"103_CR15","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TEVC.2003.817234","volume":"7","author":"Mikkel T Jensen","year":"2003","unstructured":"Jensen MT (2003) Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms. IEEE Trans Evolut Comput 7(5):503\u2013515","journal-title":"IEEE Trans Evolut Comput"},{"key":"103_CR16","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1101\/gr.648603","volume":"13","author":"Yuval Kluger","year":"2003","unstructured":"Kluger Y, Basri R, Chang JT, Gerstein M (2003) Spectral bi-clustering of microarray data: co-clustering genes and conditions. Genome Res 13:703\u2013716","journal-title":"Genome Res"},{"issue":"1","key":"103_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"Hans-Peter Kriegel","year":"2009","unstructured":"Kriegel H-P, Kr\u00f6ger P, Zimek A (2009) Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering and correlation clustering. ACM Trans Knowl Discov Data 3(1):1\u201358","journal-title":"ACM Trans Knowl Discov Data"},{"key":"103_CR18","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/widm.1057","volume":"2","author":"Hans-Peter Kriegel","year":"2012","unstructured":"Kriegel H-P, Kr\u00f6ger P, Zimek A (2012) Subspace clustering. WIREs Data Mining Knowl Discov 2:351\u2013364","journal-title":"WIREs Data Mining Knowl Discov"},{"key":"103_CR19","doi-asserted-by":"crossref","unstructured":"Liebovitch L, Toth T (1989) A fast algorithm to determine fractal dimensions by box counting. Phys Lett 141A(8)","DOI":"10.1016\/0375-9601(89)90854-2"},{"issue":"1","key":"103_CR20","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10994-009-5154-2","volume":"82","author":"Yanping Lu","year":"2011","unstructured":"Lu Y, Wang S, Li S, Zhou C (2011) Particle swarm optimizer for variable weighting in clustering high-dimensional data. Machine Learn 82(1):43\u201370","journal-title":"Machine Learn"},{"key":"103_CR21","volume-title":"Symbiosis as a source of evolutionary innovation","author":"Lynn Margulis","year":"1991","unstructured":"Margulis L, Fester R (1991) Symbiosis as a source of evolutionary innovation. MIT Press, Cambridge"},{"key":"103_CR22","volume-title":"The EM algorithm and extensions","author":"Geoffrey McLachlan","year":"1997","unstructured":"McLachlan G, Krishnan T (1997) The EM algorithm and extensions. Wiley-Interscience,"},{"key":"103_CR23","doi-asserted-by":"crossref","unstructured":"Moise G, Sander J (2008) Finding non-redundant, statistically significant regions in high dimensional data: a novel approach to projected and subspace clustering. In ACM International conference on knowledge discovery and data mining, pp 533\u2013541. ACM","DOI":"10.1145\/1401890.1401956"},{"key":"103_CR24","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10115-009-0226-y","volume":"21","author":"Gabriela Moise","year":"2009","unstructured":"Moise G, Zimek A, Kr\u00f6ger P, Kriegel H-P, Sander J (2009) Subspace and projected clustering: experimental evaluation and analysis. Knowl Inform Syst 21:299\u2013326","journal-title":"Knowl Inform Syst"},{"key":"103_CR25","first-page":"1270","volume":"2","author":"Emmanuel M\u00fcller","year":"2009","unstructured":"M\u00fcller E, G\u00fcnnemann S, Assent I, Seidl T (2009) Evaluating clustering in subspace projections of high dimensional data. Int Conf Very Large Data Bases 2:1270\u20131281","journal-title":"Int Conf Very Large Data Bases"},{"key":"103_CR26","doi-asserted-by":"crossref","unstructured":"Nourashrafeddin S, Arnold D, Milios E (2012) An evolutionary subspace clustering algorithm for high-dimensional data. In Proceedings of the ACM genetic and evolutionary computation conference companion, pp 1497\u20131498","DOI":"10.1145\/2330784.2331011"},{"key":"103_CR27","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1086\/508102","volume":"72","author":"Samir Okasha","year":"2005","unstructured":"Okasha S (2005) Multilevel selection and the major transitions in evolution. Philos Sci 72:1013\u20131025","journal-title":"Philos Sci"},{"key":"103_CR28","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"Lance Parsons","year":"2004","unstructured":"Parsons L, Haque E, Liu H (2004) Subspace clustering for high dimensional data: a review. ACM SIGKDD Explor Newsl 6:90\u2013105","journal-title":"ACM SIGKDD Explor Newsl"},{"key":"103_CR29","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1109\/TKDE.2006.106","volume":"18","author":"Anne Patrikainen","year":"2006","unstructured":"Patrikainen A, Meila M (2006) Comparing subspace clusterings. IEEE Trans Knowl Data Eng 18:902\u2013916","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"103_CR30","unstructured":"Pelleg D, Moore AW et\u00a0al (2000) X-means: extending k-means with efficient estimation of the number of clusters. In International conference on machine learning, pp 727\u2013734"},{"key":"103_CR31","doi-asserted-by":"crossref","unstructured":"Procopiuc CM, Jones M, Agarwal PK, Murali TM (2002) A monte carlo algorithm for fast projective clustering. In ACM International conference on management of data, SIGMOD \u201902, pages 418\u2013427, New York, NY, USA, 2002. ACM","DOI":"10.1145\/564691.564739"},{"key":"103_CR32","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1098\/rstb.2000.0727","volume":"355","author":"David C Queller","year":"2000","unstructured":"Queller DC (2000) Relatedness and the fracternal major transitions. Philos Trans R Soc Lond B 355:1647\u20131655","journal-title":"Philos Trans R Soc Lond B"},{"issue":"4","key":"103_CR33","first-page":"810","volume":"13","author":"Lily Rachmawati","year":"2009","unstructured":"Rachmawati L, Srinivasan D (2009) Multiobjective evolutionary algorithm with controllable focus on the knees of the pareto front. IEEE Trans Evolut Comput 13(4):810\u2013824","journal-title":"IEEE Trans EvolutComput"},{"key":"103_CR34","doi-asserted-by":"crossref","unstructured":"Sarafis IA, Trinder PW, Zalzala AMS (2003) Towards effective subspace clustering with an evolutionary algorithm. In IEEE Congress on Evolutionary Computation, pp 797\u2013806","DOI":"10.1109\/CEC.2003.1299749"},{"key":"103_CR35","doi-asserted-by":"crossref","unstructured":"Sch\u00fctze O, Laumanns M, Coello CAC (2008) Approximating the knee of an MOP with stochastic search algorithms. In Parallel problem solving from nature, volume 5199 of LNCS, pp 795\u2013804","DOI":"10.1007\/978-3-540-87700-4_79"},{"key":"103_CR36","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/s10618-012-0258-x","volume":"26","author":"K Sim","year":"2012","unstructured":"Sim K, Gopalkrishnan V, Zimek A, Cong G (2012) A survey on enhanced subspace clustering. Data Mining Knowl Discov 26:332\u2013397","journal-title":"Data Mining Knowl Discov"},{"key":"103_CR37","doi-asserted-by":"crossref","unstructured":"Vahdat A, Heywood MI, Zincir-Heywood AN (2010) bottom\u2013up evolutionary subspace clustering. In IEEE Congress on Evolutionary Computation, pp 1371\u20131378","DOI":"10.1109\/CEC.2010.5585962"},{"key":"103_CR38","doi-asserted-by":"crossref","unstructured":"Vahdat A, Heywood MI, Zincir-Heywood AN (2012) Symbiotic evolutionary subspace clustering. In IEEE Congress on Evolutionary Computation, pp 2724\u20132731","DOI":"10.1109\/CEC.2012.6252895"},{"issue":"1","key":"103_CR39","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"M Vaidya Pravin","year":"1989","unstructured":"Vaidya PM (1989) Ano (n logn) algorithm for the all-nearest-neighbors problem. Discret Comput Geometr 4(1):101\u2013115","journal-title":"Discret Comput Geometr"},{"key":"103_CR40","unstructured":"Witten IH, Frank E (2005) Data mining: practical machine learning tools and techniques. Morgan Kaufmann, 2 edn"},{"key":"103_CR41","unstructured":"Wu SX, Banzhaf W (2011) A hierarchical cooperative evolutionary algorithm. In ACM Genetic and Evolutionary Computation Conference, pp 233\u2013240"},{"key":"103_CR42","unstructured":"Yiu ML, Mamoulis N (2003) Frequent-pattern based iterative projected clustering. IEEE International Conference on Data Mining, page 689"},{"key":"103_CR43","unstructured":"Zhu L, Cao L, Yang J (2012) Multiobjective evolutionary algorithm-based soft subspace clustering. In Evolutionary Computation (CEC), 2012 IEEE Congress on, pp 2732\u20132739"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-013-0103-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12065-013-0103-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-013-0103-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T10:49:20Z","timestamp":1565088560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12065-013-0103-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,12]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["103"],"URL":"https:\/\/doi.org\/10.1007\/s12065-013-0103-1","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,12]]}}}