A Briefest Feature Subset Selection Algorithm Based on Preference Attribute

Abstract:

Concept lattice is the core data structure of formal concept analysis and represents the order relationship between the concepts iconically. Feature selection has been the focus of research in machine learning.And feature selection has been shown very effective in removing irrelevant and redundant features,also increasing efficiency in learning process and obtaining more intelligible learned results.This paper proposes a new briefest feature subset selection algorithm based on preference attribute on the basis of study of concept lattice theory. User can put forward a preference attribute according to their subjective experiences, all the briefest feature subsets containing the given attribute can be discovered by the algorithm. It firstly find some special concept pairs and calculate their waned-value hypergraph, then obtain the minimal transversal of the hypergraph as a result. A practical example proves the method is cogent and effective.

• Periodical: Advanced Materials Research (Volumes 774-776)
• Pages: 1816-1822
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.774-776.1816
• Online since: September 2013
• Authors: Kai Yang, Yong Long Jin, Zhi Jun He
• Keywords: Concept Lattice, Decision Table, Feature Selection, Hypergraph

References

[1] Liu H, Motoda H. Feature selection for knowledge discovery and data mining. Kluwer: Academic Publishers, 1998, 214.

[2] SUN Yue-peng, Liu Min, Hao Jing-hua, Wu Cheng. Prediction algorithm of Trim beam Number Using Modified SVM-Based Feature Selection. 2009, 32(6): 88-92.

[3] Wang Lu, Qiu Tao-Rong, He Niu, Liu Ping. A method for feature selection based on rough sets and ant colonyoptimization algorithm. Journal of NanJing University(Natural Sciences), 2010, 46(5): 487-493.

[4] Liang Yan, HE Zhong-Shi. A Novel Feature Selection Heuristic Algorithm Based on Rough Set Theory. Computer Science, 2007, 34(6): 162-165.

[5] Ganter B. Wille R. Formal concept Analysis. New York, USA: Springer-Verlag. (1999).

[6] Yong P. Software Retrieval by Samples Using Concept Analysis. The Joural of Systems and Software, 2000, 54: 179-183.

[7] Kuznetsov S O. Machine learning on the basis of formal concept analysis. Automation and Remote Control, 2001, 62(10): 1543-1564.

[8] Carpineto C, Romano G. Information retrieval through hybrid navigation of lattice representations. International Journal of Human-Computer Studies, 1996, 45: 553-578.

DOI: 10.1006/ijhc.1996.0067

[9] Chu S, Cesnik B. Knowledge Representation and Retrieval Using Conceptual Graphs and Free Document Self-Organisation Techniques. International Journal of Medical Infomatics, 2001, 62: 121-2133.

DOI: 10.1016/s1386-5056(01)00156-3

[10] Ma Y, Zeng ZW, Chi CY, Wu JS. Formal Concept and it's new evolution[M]. Bei Jing: Science Press, (2011).

[11] Ma Y, Zhang XD, Chi CY. Compact dependencies and intent waned values. Journal of Software, 2011, 22(5): 962-971.

DOI: 10.3724/sp.j.1001.2011.03807