Query-learning-based iterative feature-subset selection for learning from high-dimensional data sets

Knowledge and Information Systems

Volumn 9, Issue 1, 2006, Pages 91-108

  Mamitsuka, Hiroshi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Drug design; Feature subset selection; High dimensional data set; Query learning; Uncertainty sampling

Indexed keywords

CLUSTERING ALGORITHMS; FEATURE EXTRACTION; FORECASTING; ITERATIVE METHODS; QUERY PROCESSING; SET THEORY;

DRUG DESIGN; FEATURE SUBSET SELECTION; HIGH DIMENSIONAL DATA; QUERY LEARNING; UNCERTAINTY SAMPLINGS;

DATA MINING;

EID: 32544441216     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-005-0199-4     Document Type: Article

References (25)

1. Breiman, L (1999) Pasting small votes for classification in large databases and on-line. Mach Learn 36(1-2):85-103
2. Forman G (2003) An extensive empirical study of feature selection metrics for text classification. J Mach Learn Res 3:1289-1305
3. Freund Y, Shapire R (1997) A decision theoretic generalization of on-line learning and an application to boosting. J Comput Sys Sci 55(1):119-139
4. Freund Y, Seung H, Shamir E, Tishby N (1997) Selective sampling using the query by committee algorithm. Mach Learn 28(2-3):133-168
5. Hagmann M (2000) Computers aid vaccine design. Science 290(5489):80-82
6. Ho TK (1998) The random subspace method for constructing decision forests. IEEE Trans Pattern Anal Mach Intell 20(8):832-844
7. Joachims T (1999) Making large-scale SVM learning practical, In: Scholkopf B, Burges C, Smola A (eds) Advances in Kernel methods-support vector learning, B. MIT Press, Cambridge, MA, pp 41-56
8. Kohavi R, John GH (1997) Wrappers for feature subset selection. Artif Intell 97(1-2):273-324
9. Koller D, Sahami M (1996) Toward optimal feature selection, In: Saitta L (ed) Proceedings of the thirteenth international conference on machine learning. Morgan Kaufmann, Bari, Italy, pp. 284-292
10. Kononenko I, Hong SJ (1997) Attribute selection for modelling. Future Gener Comput Sys 13(2-3):181-195
11. Lewis D, Catlett J (1994) Heterogeneous uncertainty sampling for supervised learning. In: Cohen W, Hirsh H (eds) Proceedings of the eleventh international conference on machine learning, Morgan Kaufmann, Brunswick, pp. 148-156
12. Lewis D, Gale W (1994) Training text classifiers by uncertainty sampling. In: Smeaton AF (ed) Proceedings of the seventeenth annual international ACM SIGIR conference on research and development in information retrieval. ACM, Dublin, Ireland, pp. 3-12
13. Liu H, Motoda H (1998) Feature selection for knowledge discovery and data mining. Kluwer, Boston.
14. Mamitsuka H (2002) Iteratively selecting feature subsets for mining from high-dimensional databases. In: Elomaa T, Mannila H, Toivonen H (eds) Proceedings of the 6th European conference on principles and practice of knowledge discovery in databases. Springer, Berlin Heidelberg New York, pp. 361-372
15. Mamitsuka H (2003) Empirical evaluation of ensemble feature subset selection methods for learning from a high-dimensional database in drug design. In: Bourbakis N (ed) Proceedings of the third IEEE international symposium on bioinformatics and bioengineering. IEEE Computer Society Press, Bethesda, MD, pp. 253-257
16. Mamitsuka H, Abe N (2000) Efficient mining from large databases by query learning. In: Langley P (ed) Proceedings of the seventeenth international conference on machine learning. Morgan Kaufmann, Stanford University, Stanford, pp. 575-582
17. Miller MA (2002) Chemical database techniques in drug discovery. Nat Rev Drug Discovery 1:220-227
18. Ng A (1998) On feature selection: Learning with exponentially many irrelevant features as training examples. In: Shavlik J (ed) Proceedings of the fifteenth international conference on machine learning. Morgan Kaufmann, Madison, WI, pp. 404-412
19. Provost F, Kolluri V (1999) A survey of methods for scaling up inductive algorithms. Know Discovery Data Min 3(2):131-169
20. Quinlan J (1983) Learning efficient classification procedures and their applications to chess endgames. In: Michalski RS, Carbonell JG, Mitchell TM (eds) Machine learning: An artificial intelligence approach. Morgan Kaufmann, Palo Alto, CA, pp. 463-482
21. Quinlan J (1993) C4.5: Programs for machine learning. Morgan Kaufmann, San Mateo, CA
22. Räsch G, Onoda T, Müller KR (2001) Soft margins for AdaBoost. Mach Learn 42(3):287-320
23. Seung HS, Opper N, Sompolinsky H (1992) Query by committee. In: Haussler D (ed) Proceedings of the 5th international conference on computational learning theory. Morgan Kaufmann, New York, pp. 287-294
24. Xing EP, Karp RM (2001) CLIFF: Clustering of high-dimensional microarray data via feature filtering using normalized cuts. Bioinformatics 17(Suppl 1):S306-S315
25. Xing EP, Jordan MI, Karp RM (2001) Feature selection for high-dimensional genomic microarray data. In: Brodley CE, Danyluk AP (eds) Proceedings of the eighteenth international conference on machine learning. Morgan Kaufmann, Madison, WI, pp. 601-608