Sciweavers

352 search results - page 44 / 71
» A Fast Decision Tree Learning Algorithm
Sort
View
CSDA
2007
142views more  CSDA 2007»
14 years 11 months ago
DIVCLUS-T: A monothetic divisive hierarchical clustering method
DIVCLUS-T is a divisive hierarchical clustering algorithm based on a monothetic bipartitional approach allowing the dendrogram of the hierarchy to be read as a decision tree. It i...
Marie Chavent, Yves Lechevallier, Olivier Briant
116
Voted
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
15 years 11 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
ROBOCUP
2007
Springer
99views Robotics» more  ROBOCUP 2007»
15 years 5 months ago
Instance-Based Action Models for Fast Action Planning
Abstract. Two main challenges of robot action planning in real domains are uncertain action effects and dynamic environments. In this paper, an instance-based action model is lear...
Mazda Ahmadi, Peter Stone
SIGIR
2003
ACM
15 years 4 months ago
Question classification using support vector machines
Question classification is very important for question answering. This paper presents our research work on automatic question classification through machine learning approaches. W...
Dell Zhang, Wee Sun Lee
IJCAI
2007
15 years 14 days ago
Occam's Razor Just Got Sharper
Occam’s razor is the principle that, given two hypotheses consistent with the observed data, the simpler one should be preferred. Many machine learning algorithms follow this pr...
Saher Esmeir, Shaul Markovitch