Sciweavers

7150 search results - page 1020 / 1430
» Graph-Based Data Mining
Sort
View
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
16 years 5 months ago
SCAN: a structural clustering algorithm for networks
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...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
16 years 5 months ago
Scalable look-ahead linear regression trees
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 ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
16 years 5 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
Rhonda Chaytor
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
16 years 5 months ago
Training linear SVMs in linear time
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
Thorsten Joachims
KDD
2006
ACM
120views Data Mining» more  KDD 2006»
16 years 5 months ago
Hierarchical topic segmentation of websites
In this paper, we consider the problem of identifying and segmenting topically cohesive regions in the URL tree of a large website. Each page of the website is assumed to have a t...
Ravi Kumar, Kunal Punera, Andrew Tomkins
« Prev « First page 1020 / 1430 Last » Next »