[图书][B] Data mining with decision trees: theory and applications

OZ Maimon, L Rokach - 2014 - books.google.com
Decision trees have become one of the most powerful and popular approaches in
knowledge discovery and data mining; it is the science of exploring large and complex …

A novel feature selection approach: combining feature wrappers and filters

Ö Uncu, IB Türkşen - Information Sciences, 2007 - Elsevier
Feature selection is one of the most important issues in the research fields such as system
modelling, data mining and pattern recognition. In this study, a new feature selection …

[PDF][PDF] Anytime Learning of Decision Trees.

S Esmeir, S Markovitch - Journal of Machine Learning Research, 2007 - jmlr.org
The majority of existing algorithms for learning decision trees are greedy—a tree is induced
topdown, making locally optimal decisions at each node. In most cases, however, the …

Info-fuzzy algorithms for mining dynamic data streams

L Cohen, G Avrahami, M Last, A Kandel - Applied soft computing, 2008 - Elsevier
Most data-mining algorithms assume static behavior of the incoming data. In the real world,
the situation is different and most continuously collected data streams are generated by …

[HTML][HTML] Issues in optimization of decision tree learning: A survey

DV Patil, RS Bichkar - International Journal of Applied Information Systems, 2012 - ijais.org
Decision tree induction is a simple but powerful learning and classification model. Decision
tree learning offers tools for discovery of relationships, patterns and knowledge from data in …

Measuring power of algorithms, computer programs and information automata

M Burgin - 2010 - elibrary.ru
We are living in a world where complexity of systems created and studied by people grows
beyond all imaginable limits. Computers, their software and their networks are among the …

$-calculus of bounded rational agents: Flexible optimization as search under bounded resources in interactive systems

E Eberbach - Fundamenta Informaticae, 2005 - content.iospress.com
This paper presents a novel model for resource bounded computation based on process
algebras. Such model is called the $-calculus (cost calculus). Resource bounded …

Data reduction for pattern recognition and data analysis

TWS Chow, D Huang - Computational Intelligence: A Compendium, 2008 - Springer
Pattern recognition involves various human activities of great practical significance, such as
data-based bankruptcy prediction, speech/image recognition, machine fault detection and …

Interruptible anytime algorithms for iterative improvement of decision trees

S Esmeir, S Markovitch - Proceedings of the 1st international workshop …, 2005 - dl.acm.org
Finding a minimal decision tree consistent with the examples is an NP-complete problem.
Therefore, most of the existing algorithms for decision tree induction use a greedy approach …

A new algorithm for optimization of fuzzy decision tree in data mining

A Kazemi, E Mehrzadegan - 2011 - sid.ir
Decision-tree algorithms provide one of the most popular methodologies for symbolic
knowledge acquisition. The resulting knowledge, a symbolic DECISION TREE along with a …