Sciweavers

1836 search results - page 302 / 368
» Mining Clustering Dimensions
Sort
View
139
Voted
WWW
2006
ACM
16 years 4 months ago
Discovering event evolution graphs from newswires
In this paper, we propose an approach to automatically mine event evolution graphs from newswires on the Web. Event evolution graph is a directed graph in which the vertices and e...
Christopher C. Yang, Xiaodong Shi
KDD
2009
ACM
141views Data Mining» more  KDD 2009»
16 years 4 months ago
Meme-tracking and the dynamics of the news cycle
Tracking new topics, ideas, and "memes" across the Web has been an issue of considerable interest. Recent work has developed methods for tracking topic shifts over long ...
Jure Leskovec, Lars Backstrom, Jon M. Kleinberg
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
16 years 3 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...
KDD
2006
ACM
121views Data Mining» more  KDD 2006»
16 years 3 months ago
Query-time entity resolution
The goal of entity resolution is to reconcile database references corresponding to the same real-world entities. Given the abundance of publicly available databases where entities...
Indrajit Bhattacharya, Lise Getoor, Louis Licamele
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
16 years 3 months ago
On the use of linear programming for unsupervised text classification
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
Mark Sandler