Sciweavers

455 search results - page 40 / 91
» On Trees and Noncrossing Partitions
Sort
View
SAC
2009
ACM
14 years 2 months ago
LEGAL-tree: a lexicographic multi-objective genetic algorithm for decision tree induction
Decision trees are widely disseminated as an effective solution for classification tasks. Decision tree induction algorithms have some limitations though, due to the typical strat...
Márcio P. Basgalupp, Rodrigo C. Barros, And...
CJCDGCGT
2005
Springer
13 years 9 months ago
Fractional Vertex Arboricity of Graphs
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...
Qinglin Yu, Lian-Cui Zuo
ECML
2007
Springer
14 years 2 months ago
Clustering Trees with Instance Level Constraints
Abstract. Constrained clustering investigates how to incorporate domain knowledge in the clustering process. The domain knowledge takes the form of constraints that must hold on th...
Jan Struyf, Saso Dzeroski
ECML
1997
Springer
13 years 12 months ago
Global Data Analysis and the Fragmentation Problem in Decision Tree Induction
We investigate an inherent limitation of top-down decision tree induction in which the continuous partitioning of the instance space progressively lessens the statistical support o...
Ricardo Vilalta, Gunnar Blix, Larry A. Rendell
GIS
2010
ACM
13 years 5 months ago
Efficient indexing structure for scalable processing of spatial alarms
Spatial Alarms are reminders for mobile users upon their arrival of certain spatial location of interest. Spatial alarm processing requires meeting two demanding objectives: high ...
Myungcheol Doo, Ling Liu, Nitya Narasimhan, Venu V...