Sciweavers

45 search results - page 5 / 9
» Decision Trees Using the Minimum Entropy-of-Error Principle
Sort
View
ICDM
2006
IEEE
122views Data Mining» more  ICDM 2006»
14 years 1 months ago
Optimal Segmentation Using Tree Models
Sequence data are abundant in application areas such as computational biology, environmental sciences, and telecommunications. Many real-life sequences have a strong segmental str...
Robert Gwadera, Aristides Gionis, Heikki Mannila
SWAT
1992
Springer
116views Algorithms» more  SWAT 1992»
13 years 11 months ago
Sorting Multisets Stably in Minimum Space
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
Jyrki Katajainen, Tomi Pasanen
IJCAI
1997
13 years 8 months ago
Minimum Splits Based Discretization for Continuous Features
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness m...
Ke Wang, Han Chong Goh
FLAIRS
2008
13 years 9 months ago
A Backward Adjusting Strategy and Optimization of the C4.5 Parameters to Improve C4.5's Performance
In machine learning, decision trees are employed extensively in solving classification problems. In order to design a decision tree classifier two main phases are employed. The fi...
Jason R. Beck, Maria Garcia, Mingyu Zhong, Michael...
ISSRE
2007
IEEE
13 years 9 months ago
Using Machine Learning to Support Debugging with Tarantula
Using a specific machine learning technique, this paper proposes a way to identify suspicious statements during debugging. The technique is based on principles similar to Tarantul...
Lionel C. Briand, Yvan Labiche, Xuetao Liu