110 search results - page 5 / 22 » kdd 2005 |
KDD
2005
ACM
14 years 10 months ago
2005
ACM
Several authors have suggested viewing boosting as a gradient descent search for a good fit in function space. At each iteration observations are re-weighted using the gradient of...
KDD
2005
ACM
14 years 10 months ago
2005
ACM
We propose a hybrid, unsupervised document clustering approach that combines a hierarchical clustering algorithm with Expectation Maximization. We developed several heuristics to ...
KDD
2005
ACM
14 years 10 months ago
2005
ACM
In this paper, we show that stylistic text features can be exploited to determine an anonymous author's native language with high accuracy. Specifically, we first use automat...
KDD
2005
ACM
14 years 10 months ago
2005
ACM
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
KDD
2005
ACM
14 years 10 months ago
2005
ACM
Significant vulnerabilities have recently been identified in collaborative filtering recommender systems. These vulnerabilities mostly emanate from the open nature of such systems ...