{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T21:39:28Z","timestamp":1790717968935,"version":"4.1.0"},"reference-count":41,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2012,12,27]],"date-time":"2012-12-27T00:00:00Z","timestamp":1356566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Feature selection, also known as attribute selection, is the technique of selecting a subset of relevant features for building robust object models. It is becoming more and more important for large-scale sensors applications with AI capabilities. The core idea of this paper is derived from a straightforward and intuitive principle saying that, if a feature subset (pattern) has more representativeness, it should be more self-organized, and as a result it should be more insensitive to artificially seeded noise points. In the light of this heuristic finding, we established the whole set of theoretical principles, based on which we proposed a two-stage framework to evaluate the relative importance of feature subsets, called seeding and harvest (S&amp;H for short). At the first stage, we inject a number of artificial noise points into the original dataset; then at the second stage, we resort to an outlier detector to identify them under various feature patterns. The more precisely the seeded points can be extracted under a particular feature pattern, the more valuable and important the corresponding feature pattern should be. Besides, we compared our method with several state-of-the-art feature selection methods on a number of real-life datasets. The experiment results significantly confirm that our method can accomplish feature reduction tasks with high accuracy as well as low computing complexity.<\/jats:p>","DOI":"10.3390\/s130100292","type":"journal-article","created":{"date-parts":[[2012,12,27]],"date-time":"2012-12-27T11:08:31Z","timestamp":1356606511000},"page":"292-333","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Seeding and Harvest: A Framework for Unsupervised Feature Selection Problems"],"prefix":"10.3390","volume":"13","author":[{"given":"Gang","family":"Chen","sequence":"first","affiliation":[{"name":"School of Electronic and Information Engineering, Xi\u2019an Jiaotong University, No.28, Xianning West Road, Xi\u2019an 710049, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuanli","family":"Cai","sequence":"additional","affiliation":[{"name":"School of Electronic and Information Engineering, Xi\u2019an Jiaotong University, No.28, Xianning West Road, Xi\u2019an 710049, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan","family":"Shi","sequence":"additional","affiliation":[{"name":"School of Electronic and Information Engineering, Xi\u2019an Jiaotong University, No.28, Xianning West Road, Xi\u2019an 710049, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2012,12,27]]},"reference":[{"key":"ref_1","unstructured":"Han, J., and Kamber, M. (2006). Data Mining: Concepts and Techniques, Elsevier."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.dss.2011.01.008","article-title":"Information mining\u2014Reflections on recent advancements and the road ahead in data, text, and media mining","volume":"51","author":"Gopal","year":"2011","journal-title":"Decis. Support Syst."},{"key":"ref_3","first-page":"195","article-title":"Data mining in bioinformatics: Selected papers from BIOKDD","volume":"7","author":"Lonardi","year":"2010","journal-title":"IEEE ACM Trans. Comput. Bi."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/B:MACH.0000011805.60520.fe","article-title":"Selective sampling for nearest neighbor classifiers","volume":"54","author":"Lindenbaum","year":"2004","journal-title":"Mach. Learn."},{"key":"ref_5","unstructured":"Hall, M.A. (1999). Correlation-Based Feature Selection for Machine Learning. [PhD Thesis, Department of Computer Science, University of Waikato]."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/TSMCC.2004.829279","article-title":"Discovering golden nuggets: Data mining in financial application","volume":"34","author":"Zhang","year":"2004","journal-title":"IEEE Trans. Syst. Man Cybern. C Appl. Rev."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Bellman, R.E. (1961). Adaptive Control Processes\u2014A Guided Tour., Princeton University Press.","DOI":"10.1515\/9781400874668"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","article-title":"Wrappers for Feature Subset Selection","volume":"97","author":"Kohavi","year":"1997","journal-title":"Artif. Intell."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/1007730.1007731","article-title":"Subspace clustering for high dimensional data: A review","volume":"6","author":"Parsons","year":"2004","journal-title":"SIGKDD Explor. Newsl."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/6104.956807","article-title":"Feature transformation methods in data mining","volume":"24","author":"Kusiak","year":"2001","journal-title":"IEEE Trans. Electron. Packag. Manuf."},{"key":"ref_11","unstructured":"Mitchell, T.M. (1997). Machine Learning, McGraw Hill."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/5254.671091","article-title":"Feature subset selection using a genetic algorithm","volume":"13","author":"Yang","year":"1998","journal-title":"IEEE Intell. Syst."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1016\/j.patrec.2004.09.044","article-title":"On fuzzy-rough sets approach to feature selection","volume":"26","author":"Bhatt","year":"2005","journal-title":"Pattern Recogn. Lett."},{"key":"ref_14","unstructured":"Quinlan, J.R. (1993). C4.5: Programs for Machine Learning, Morgan Kaufmann Publishers Inc."},{"key":"ref_15","first-page":"1157","article-title":"An introduction to variable and feature selection","volume":"3","author":"Guyon","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"ref_16","unstructured":"Chen, G., Cai, Y., and Shi, J. (March, January 20\u2013). Ordinal Isolation: An Efficient and Effective Intelligent Outlier Detection Algorithm. Kunming, China."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/335191.335388","article-title":"LOF: Identifying density-based local outliers","volume":"29","author":"Breunig","year":"2000","journal-title":"ACM SIGMOD Record"},{"key":"ref_18","unstructured":"Liu, F.T., Ting, K.M., and Zhou, Z.H. (December, January 15\u2013). Isolation Forest. Pisa, Italy."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1437","DOI":"10.1109\/TKDE.2003.1245283","article-title":"Benchmarking attribute selection techniques for discrete class data mining","volume":"15","author":"Hall","year":"2003","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/584091.584093","article-title":"A mathematical theory of communication","volume":"5","author":"Shannon","year":"2001","journal-title":"SIGMOBILE Mob. Comput. Commun. Rev."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1016\/j.patcog.2008.10.028","article-title":"Feature selection with dynamic mutual information","volume":"42","author":"Liu","year":"2009","journal-title":"Pattern Recogn."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"2834","DOI":"10.1016\/j.patcog.2011.04.014","article-title":"Correntropy based feature selection using binary projection","volume":"44","author":"Yan","year":"2011","journal-title":"Pattern Recogn."},{"key":"ref_23","unstructured":"Kira, K., and Rendell, L.A. (1992). Proceeding: ML92 Proceedings of the Ninth International Workshop on Machine Learning, Morgan Kaufmann Publishers Inc."},{"key":"ref_24","unstructured":"Kononenko, I. (, January 6\u20138April). Estimating Attributes: Analysis and Extensions of RELIEF. Catana, Italy."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s10994-009-5164-0","article-title":"Algorithms for subsetting attribute values with relief","volume":"78","author":"Demsar","year":"2010","journal-title":"Mach. Learn."},{"key":"ref_26","unstructured":"Hall, M.A. (July, January 29). Correlation-Based Feature Selection for Discrete and Numeric Class Machine Learning. Stanford, CA, USA."},{"key":"ref_27","unstructured":"Liu, H., and Setiono, R. (1996, January 14\u201318). A Probabilistic Approach to Feature Selection\u2014A Filter Solution. Montreal, QC, Canada."},{"key":"ref_28","unstructured":"Almuallim, H., and Dietterich, T.G. (1991, January 14\u201319). Learning with Many Irrelevant Features. Anaheim, CA, USA. Volume 2."},{"key":"ref_29","first-page":"845","article-title":"Feature selection for unsupervised learning","volume":"5","author":"Dy","year":"2004","journal-title":"J. Mach. Learn. Res."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2742","DOI":"10.1016\/j.patcog.2008.03.007","article-title":"Unsupervised feature selection using clustering ensembles and population based incremental learning algorithm","volume":"41","author":"Hong","year":"2008","journal-title":"Pattern Recogn."},{"key":"ref_31","unstructured":"Cai, D., Zhang, C., and He, X. (July, January 25\u2013). Unsupervised Feature Selection for Multi-cluster Data. Washington, DC, USA."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Zhao, Z., and Liu, H. (2007, January 20\u201324). Spectral Feature Selection for Supervised and Unsupervised Learning. Corvalis, OR, USA.","DOI":"10.1145\/1273496.1273641"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/34.990133","article-title":"Unsupervised feature selection using feature similarity","volume":"24","author":"Mitra","year":"2002","journal-title":"IEEE Trans. Pattern Anal."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least squares quantization in PCM","volume":"28","author":"Lloyd","year":"1982","journal-title":"IEEE Inform. Theory."},{"key":"ref_35","unstructured":"Johnson, R., and Wichern, D. (2007). Applied Multivariate Statistical Analysis, Pearson Prentice Hall. [6th ed.]."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Gallager, R. (2008). Principles of Digital Communication, Cambridge University Press.","DOI":"10.1017\/CBO9780511813498"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.13.4.517","article-title":"An additive algorithm for solving linear programs with zero-one variables","volume":"13","author":"Balas","year":"1965","journal-title":"Oper. Res."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Ho, Y.C., Zhao, Q.C., and Jia, Q.S. (2007). Ordinal Optimization: Soft Optimization for Hard Problems, Springer.","DOI":"10.1007\/978-0-387-68692-9"},{"key":"ref_39","unstructured":"Wikipedia Plagiarism\u2014Wikipedia, The Free Encyclopedia. Available online: http:\/\/en.wikipedia.org\/wiki\/Plagarism (accessed on 30 December 2011)."},{"key":"ref_40","unstructured":"Frank, A., and Asuncion, A. UCI Machine Learning Repository. Available online: http:\/\/archive.ics.uci.edu\/ml\/ (accessed on 30 December 2010)."},{"key":"ref_41","unstructured":"Witten, I.H., and Frank, E. (2005). Data Mining: Practical Machine Learning Tools and Techniques, Morgan Kaufmann. [2nd ed.]."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/13\/1\/292\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:54:29Z","timestamp":1760219669000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/13\/1\/292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,27]]},"references-count":41,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2013,1]]}},"alternative-id":["s130100292"],"URL":"https:\/\/doi.org\/10.3390\/s130100292","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,27]]}}}