191
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
220
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
200
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
142
click to vote
KDD
2001
ACM
2001
ACM
Gaining insights into support vector machine pattern classifiers using projection-based tour methods
16 years 7 months ago
166
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
This paper is concerned with the construction of regression and classification trees that are more adapted to data mining applications than conventional trees. To this end, we pro...
152
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
Skewed distributions appear very often in practice. Unfortunately, the traditional Zipf distribution often fails to model them well. In this paper, we propose a new probability di...
