Sciweavers

9166 search results - page 1797 / 1834
» A framework for comparing models of computation
Sort
View
140
Voted
KDD
2002
ACM
170views Data Mining» more  KDD 2002»
16 years 4 months ago
Enhanced word clustering for hierarchical text classification
In this paper we propose a new information-theoretic divisive algorithm for word clustering applied to text classification. In previous work, such "distributional clustering&...
Inderjit S. Dhillon, Subramanyam Mallela, Rahul Ku...
345
Voted
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
16 years 4 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...
EDBT
2009
ACM
302views Database» more  EDBT 2009»
15 years 10 months ago
RankClus: integrating clustering with ranking for heterogeneous information network analysis
As information networks become ubiquitous, extracting knowledge from information networks has become an important task. Both ranking and clustering can provide overall views on in...
Yizhou Sun, Jiawei Han, Peixiang Zhao, Zhijun Yin,...
ICDM
2009
IEEE
160views Data Mining» more  ICDM 2009»
15 years 10 months ago
Fast Online Training of Ramp Loss Support Vector Machines
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
Zhuang Wang, Slobodan Vucetic
COMPGEOM
2009
ACM
15 years 10 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
« Prev « First page 1797 / 1834 Last » Next »