6624 search results - page 838 / 1325 » Design Pattern Recognition |
186
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
213
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
162
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we...
201
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Recent work has shown the feasibility and promise of templateindependent Web data extraction. However, existing approaches use decoupled strategies ? attempting to do data record ...
197
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...