See this document in CiteSeerX!

Anytime Algorithm for Feature Selection  (Make Corrections)  
Mark Last, Abraham Kandel, Oded Maimon, Eugene Eberbach Department of...
Lecture Notes in Computer Science



  Home/Search   Context   Related

 
View or download:
umassd.edu/~eeberbach/p...rsctc2000.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  umassd.edu/~eeberbach...paperlist (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Feature selection is used to improve performance of learning algorithms by finding a minimal subset of relevant features. Since the process of feature selection is computationally intensive, a trade-off between the quality of the selected subset and the computation time is required. In this paper, we are presenting a novel, anytime algorithm for feature selection, which gradually improves the quality of results by increasing the computation time. The algorithm is interruptible, i.e., it can ... (Update)

Similar documents (at the sentence level):
14.9%:   Information-Theoretic Algorithm for Feature Selection - Last, Kandel, Maimon   (Correct)

Active bibliography (related documents):   More   All
0.3:   Investigation of the Use of Neural Networks for Computerised.. - Shane Dickson (1998)   (Correct)
0.3:   Automated Perceptions in Data Mining - Last, Kandel (1999)   (Correct)
0.3:   Knowledge Discovery in Time Series Databases - Last, Klein, Kandel (2001)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@article{ last01anytime,
    author = "Mark Last and Abraham Kandel and Oded Maimon and Eugene Eberbach",
    title = "Anytime Algorithm for Feature Selection",
    journal = "Lecture Notes in Computer Science",
    volume = "2005",
    pages = "532--??",
    year = "2001",
    url = "citeseer.ist.psu.edu/763776.html" }
Citations (may not include all citations):
2319   Elements of Information Theory (context) - Cover - 1991
2177   Programs for Machine Learning (context) - Quinlan - 1993
1359   Induction of Decision Trees (context) - Quinlan - 1986
1262   Classification and Regression Trees (context) - Breiman, Friedman et al. - 1984
976   Machine Learning (context) - Mitchell - 1997
696   UCI Repository of machine learning databases (context) - Blake, Merz - 1998
402   An Analysis of Time-Dependent Planning (context) - Dean, Boddy - 1988
317   Learning Quickly When Irrelevant Attributes Abound: A New Li.. (context) - Littlestone - 1988
291   Irrelevant Features and the Subset Selection Problem - John, Kohavi et al. - 1994
263   Database System Concepts (context) - Korth, Silberschatz - 1991
262   From Data Mining to Knowledge Discovery: An Overview (context) - Fayyad, Piatetsky-Shapiro et al. - 1996
190   Fuzzy Sets and Fuzzy Logic: Theory and Applications (context) - Klir, Yuan - 1995
137   Do the Right Thing: Studies in Limited Rationality (context) - Russell, Wefald - 1991
128   the Optimality of the Simple Bayesian Classifier under Zero-.. - Domingos, Pazzani - 1997
120   Greedy Attribute Selection - Caruana, Freitag - 1994
93   Reasoning about Beliefs and Actions under Computational Reso.. - Horvitz - 1987
85   A Projection Pursuit Algorithm for Exploratory Data Analysis (context) - Friedman, Tukey - 1974
81   Operational Rationality through Compilation of Anytime Algor.. - Zilberstein - 1993
58   Using Anytime Algorithms in Intelligent Systems - Zilberstein - 1996
52   Feature Selection for Knowledge Discovery and Data Mining (context) - Liu, Motoda - 1998
30   A Statistical Perspective on Knowledge Discovery in Database.. - IV, Pregibon - 1996
29   Principal Components Analysis (context) - Dunteman - 1989
26   Linear Models: Least Squares and Alternatives (context) - Rao, Toutenburg - 1995
19   Efficient Algorithms for Identifying Relevant Features - Almuallim, Dietterich - 1992
8   Factor Analysis: Statistical Methods and Practical Issues (context) - Kim, Mueller - 1978
6   IEEE Transactions on Knowledge and Data Engineering (context) - Liu, Sutiono et al. - 1997
3   An Information-Theoretic Approach to Data Mining - Last, Maimon - 1999
3   Autonomous Agents and DNA-Based Computing in $-Calculus -- R.. (context) - Eberbach, Computation et al. - 2000
3   Information-Theoretic Fuzzy Approach to Knowledge Discovery .. - Maimon, Kandel et al. - 1999
1   on Intelligent Information Systems IIS (context) - Eberbach, of et al. - 2000
1   IEEE International Fuzzy Systems Conference (context) - Last, Kandel et al. - 1999

Documents on the same site (http://www.cis.umassd.edu/~eeberbach/paperlist.html):   More
Evolutionary Computation as a Multi-Agent Search: a $-Calculus.. - Eberbach (2001)   (Correct)
Flexible Optimization And Evolution Of Underwater.. - Eberbach, Brooks, Phoha (1999)   (Correct)
Expressing Evolutionary Computation, Genetic Programming, Artif.. - Eberbach (2000)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC