{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T04:46:30Z","timestamp":1777178790326,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,12,21]]},"DOI":"10.1145\/3302425.3302478","type":"proceedings-article","created":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T19:17:35Z","timestamp":1549480655000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Feature Space Decomposition using Information Theory"],"prefix":"10.1145","author":[{"given":"Radek","family":"Marik","sequence":"first","affiliation":[{"name":"Czech Technical University in Prague, Prague, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Gephi: An Open Source Software for Exploring and Manipulating Networks.","author":"Bastian Mathieu","year":"2009","unstructured":"Mathieu Bastian , Sebastien Heymann , and Mathieu Jacomy . 2009 . Gephi: An Open Source Software for Exploring and Manipulating Networks. (2009). http: \/\/www.aaai.org\/ocs\/index.php\/ICWSM\/09\/paper\/view\/154 Mathieu Bastian, Sebastien Heymann, and Mathieu Jacomy. 2009. Gephi: An Open Source Software for Exploring and Manipulating Networks. (2009). http: \/\/www.aaai.org\/ocs\/index.php\/ICWSM\/09\/paper\/view\/154"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/72.298224"},{"key":"e_1_3_2_1_3_1","volume-title":"Robust and computationally feasible community detection in the presence of arbitrary outlier nodes. Ann. Statist. 43, 3 (06","author":"Tony Cai T.","year":"2015","unstructured":"T. Tony Cai and Xiaodong Li. 2015. Robust and computationally feasible community detection in the presence of arbitrary outlier nodes. Ann. Statist. 43, 3 (06 2015 ), 1027--1059. T. Tony Cai and Xiaodong Li. 2015. Robust and computationally feasible community detection in the presence of arbitrary outlier nodes. Ann. Statist. 43, 3 (06 2015), 1027--1059."},{"key":"e_1_3_2_1_4_1","volume-title":"Thomas","author":"Cover Thomas M.","year":"1991","unstructured":"Thomas M. Cover and Joy A . Thomas . 1991 . Elements of Information Theory. John Wiley & Sons . Thomas M. Cover and Joy A. Thomas. 1991. Elements of Information Theory. John Wiley & Sons."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/844380.844731"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence. 532--539","author":"Dash M.","unstructured":"M. Dash , H. Liu , and J. Yao . 1997. Dimensionality reduction of unsupervised data . In Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence. 532--539 . M. Dash, H. Liu, and J. Yao. 1997. Dimensionality reduction of unsupervised data. In Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence. 532--539."},{"key":"e_1_3_2_1_8_1","volume-title":"24th Annual Meeting of the European Association of Archaeologists (EAA), Barcelona on","author":"Dul\u00edkov\u00e1 Veronika","year":"2018","unstructured":"Veronika Dul\u00edkov\u00e1 and Radek Mar\u00edk . 2018 . Detection of strategic functions in Old Kingdom Egypt using the information theory, presented within Session 672 Theories and methods in archaeological sciences . In 24th Annual Meeting of the European Association of Archaeologists (EAA), Barcelona on September 7, 2018. Veronika Dul\u00edkov\u00e1 and Radek Mar\u00edk. 2018. Detection of strategic functions in Old Kingdom Egypt using the information theory, presented within Session 672 Theories and methods in archaeological sciences. In 24th Annual Meeting of the European Association of Archaeologists (EAA), Barcelona on September 7, 2018."},{"key":"e_1_3_2_1_9_1","volume-title":"CAA 2018 Conference Proceedings, Computer Applications and Quantitative Methods in Archaeology international conference in T\u00fcbingen","author":"Dul\u00edkov\u00e1 Veronika","year":"2018","unstructured":"Veronika Dul\u00edkov\u00e1 and Radek Mar\u00edk . 2018 . Reconstruction of Old Kingdom administration using data mining, presented and submitted . In CAA 2018 Conference Proceedings, Computer Applications and Quantitative Methods in Archaeology international conference in T\u00fcbingen , March 2018. Veronika Dul\u00edkov\u00e1 and Radek Mar\u00edk. 2018. Reconstruction of Old Kingdom administration using data mining, presented and submitted. In CAA 2018 Conference Proceedings, Computer Applications and Quantitative Methods in Archaeology international conference in T\u00fcbingen, March 2018."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the Seventeenth International Conference on Machine Learning","author":"Dy J. G.","year":"2000","unstructured":"J. G. Dy and C. E. Brodley . 2000. Feature Subset Selection and Order Identification for Unsupervised Learning . In Proceedings of the Seventeenth International Conference on Machine Learning , June 29-July 2, 2000 , Stanford University, CA. J. G. Dy and C. E. Brodley. 2000. Feature Subset Selection and Order Identification for Unsupervised Learning. In Proceedings of the Seventeenth International Conference on Machine Learning, June 29-July 2, 2000, Stanford University, CA."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005601"},{"key":"e_1_3_2_1_12_1","volume-title":"2012 IEEE International Workshop on Machine Learning for Signal Processing. 1--6.","author":"Faivishevsky L.","unstructured":"L. Faivishevsky and J. Goldberger . 2012. Unsupervised feature selection based on non-parametric mutual information . In 2012 IEEE International Workshop on Machine Learning for Signal Processing. 1--6. L. Faivishevsky and J. Goldberger. 2012. Unsupervised feature selection based on non-parametric mutual information. In 2012 IEEE International Workshop on Machine Learning for Signal Processing. 1--6."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02163027"},{"key":"e_1_3_2_1_16_1","volume-title":"Data Mining, Concepts and Techniques","author":"Han Jiawei","unstructured":"Jiawei Han , Micheline Kamber , and Jian Pei . 2012. Data Mining, Concepts and Techniques ( third ed.). Morgan Kaufmann . Jiawei Han, Micheline Kamber, and Jian Pei. 2012. Data Mining, Concepts and Techniques (third ed.). Morgan Kaufmann."},{"key":"e_1_3_2_1_17_1","volume-title":"Principal Component Analysis","author":"Jolliffe I.T.","unstructured":"I.T. Jolliffe . 2002. Principal Component Analysis . Springer . I.T. Jolliffe. 2002. Principal Component Analysis. Springer."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/72.977291"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.71"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the 13th International Conference on Neural Information Processing Systems (NIPS'00)","author":"Lee Daniel D.","unstructured":"Daniel D. Lee and H. Sebastian Seung . 2000. Algorithms for Non-negative Matrix Factorization . In Proceedings of the 13th International Conference on Neural Information Processing Systems (NIPS'00) . MIT Press, Cambridge, MA, USA, 535--541. Daniel D. Lee and H. Sebastian Seung. 2000. Algorithms for Non-negative Matrix Factorization. In Proceedings of the 13th International Conference on Neural Information Processing Systems (NIPS'00). MIT Press, Cambridge, MA, USA, 535--541."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2014.47"},{"key":"e_1_3_2_1_22_1","volume-title":"Comparing Clusterings by the Variation of Information","author":"Meila M.","unstructured":"Meila M. 2003. Comparing Clusterings by the Variation of Information . Springer , Berlin, Heidelberg , 173--187. Meila M. 2003. Comparing Clusterings by the Variation of Information. Springer, Berlin, Heidelberg, 173--187."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2013.08.002"},{"key":"e_1_3_2_1_24_1","volume-title":"Networks: an introduction","author":"Newman M.","unstructured":"M. Newman . 2010. Networks: an introduction . Oxford University Press, Inc. M. Newman. 2010. Networks: an introduction. Oxford University Press, Inc."},{"key":"e_1_3_2_1_25_1","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman M. E. J.","year":"2003","unstructured":"M. E. J. Newman and M. Girvan . 2003 . Finding and evaluating community structure in networks . Physical Review E 69 , 2 (11 Aug. 2003), 026113+. arXiv:cond-mat\/0308217 M. E. J. Newman and M. Girvan. 2003. Finding and evaluating community structure in networks. Physical Review E 69, 2 (11 Aug. 2003), 026113+. arXiv:cond-mat\/0308217","journal-title":"Physical Review E"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1782914.1782964"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.03.002"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.159"},{"key":"e_1_3_2_1_29_1","first-page":"467","article-title":"The Architecture of Complexity","volume":"106","author":"Simon Herbert A.","year":"1962","unstructured":"Herbert A. Simon . 1962 . The Architecture of Complexity . Proceedings of the American Philosophical Society 106 , 6 (1962), 467 -- 482 . Herbert A. Simon. 1962. The Architecture of Complexity. Proceedings of the American Philosophical Society 106, 6 (1962), 467--482.","journal-title":"Proceedings of the American Philosophical Society"},{"key":"e_1_3_2_1_30_1","volume-title":"2014 Annual IEEE India Conference (INDICON). 1--6.","author":"Singh B.","unstructured":"B. Singh , J. S. Sankhwar , and O. P. Vyas . 2014. Optimization of feature selection method for high dimensional data using fisher score and minimum spanning tree . In 2014 Annual IEEE India Conference (INDICON). 1--6. B. Singh, J. S. Sankhwar, and O. P. Vyas. 2014. Optimization of feature selection method for high dimensional data using fisher score and minimum spanning tree. In 2014 Annual IEEE India Conference (INDICON). 1--6."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-013-1368-0"},{"key":"e_1_3_2_1_32_1","volume-title":"Properties, Normalization and Correction for Chance. J. Mach. Learn. Res. 11 (Dec.","author":"Vinh Nguyen Xuan","year":"2010","unstructured":"Nguyen Xuan Vinh , Julien Epps , and James Bailey . 2010. Information Theoretic Measures for Clusterings Comparison: Variants , Properties, Normalization and Correction for Chance. J. Mach. Learn. Res. 11 (Dec. 2010 ), 2837--2854. Nguyen Xuan Vinh, Julien Epps, and James Bailey. 2010. Information Theoretic Measures for Clusterings Comparison: Variants, Properties, Normalization and Correction for Chance. J. Mach. Learn. Res. 11 (Dec. 2010), 2837--2854."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Suhang Wang Jiliang Tang and Huan Liu. 2016. Feature Selection.  Suhang Wang Jiliang Tang and Huan Liu. 2016. Feature Selection.","DOI":"10.1007\/978-1-4899-7502-7_101-1"},{"key":"e_1_3_2_1_34_1","volume-title":"Witten and Eibe Frank","author":"Ian","year":"2005","unstructured":"Ian H. Witten and Eibe Frank . 2005 . Data Mining, Practical Machine Learning Tools and Techniques (second ed.). Morgan Kaufmann Publishers . Ian H. Witten and Eibe Frank. 2005. Data Mining, Practical Machine Learning Tools and Techniques (second ed.). Morgan Kaufmann Publishers."},{"key":"e_1_3_2_1_35_1","volume-title":"Information-Theoretic Measures for Knowledge Discovery and Data Mining","author":"Yao Y.Y.","unstructured":"Y.Y. Yao . 2003. Information-Theoretic Measures for Knowledge Discovery and Data Mining . Springer , Berlin, Heidelberg , 115--136. Y.Y. Yao. 2003. Information-Theoretic Measures for Knowledge Discovery and Data Mining. Springer, Berlin, Heidelberg, 115--136."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28320-8_29"},{"key":"e_1_3_2_1_37_1","volume-title":"Proceedings of the 13-th Australasian Data Mining Conference (AusDM","author":"Zaher Amer Abu","year":"2015","unstructured":"Amer Abu Zaher , Regina Berretta , Ahmed Shamsul Arefin , and Pablo Moscato . 2015 . FSMEC: A Feature Selection Method based on the Minimum Spanning Tree and Evolutionary Computation . In Proceedings of the 13-th Australasian Data Mining Conference (AusDM 2015), Sydney, Australia. 129--139. Amer Abu Zaher, Regina Berretta, Ahmed Shamsul Arefin, and Pablo Moscato. 2015. FSMEC: A Feature Selection Method based on the Minimum Spanning Tree and Evolutionary Computation. In Proceedings of the 13-th Australasian Data Mining Conference (AusDM 2015), Sydney, Australia. 129--139."},{"key":"e_1_3_2_1_38_1","volume-title":"Hancock","author":"Zhang Zhihong","year":"2011","unstructured":"Zhihong Zhang and Edwin R . Hancock . 2011 . A Graph-Based Approach to Feature Selection. In International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2011: Graph-Based Representations in Pattern Recognition GbRPR 2011: Graph-Based Representations in Pattern Recognition, X. Jiang, M. Ferrer, and A. Torsello (Eds .), Vol. 6658 . 205--214. Zhihong Zhang and Edwin R. Hancock. 2011. A Graph-Based Approach to Feature Selection. In International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2011: Graph-Based Representations in Pattern Recognition GbRPR 2011: Graph-Based Representations in Pattern Recognition, X. Jiang, M. Ferrer, and A. Torsello (Eds.), Vol. 6658. 205--214."}],"event":{"name":"ACAI 2018: 2018 International Conference on Algorithms, Computing and Artificial Intelligence","location":"Sanya China","acronym":"ACAI 2018","sponsor":["The Hong Kong Polytechnic The Hong Kong Polytechnic University","City University of Hong Kong City University of Hong Kong"]},"container-title":["Proceedings of the 2018 International Conference on Algorithms, Computing and Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3302425.3302478","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3302425.3302478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:45Z","timestamp":1750273545000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3302425.3302478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"references-count":37,"alternative-id":["10.1145\/3302425.3302478","10.1145\/3302425"],"URL":"https:\/\/doi.org\/10.1145\/3302425.3302478","relation":{},"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"2018-12-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}