KDD
2001
ACM
15 years 25 days ago
2001
ACM
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
KDD
2001
ACM
15 years 25 days ago
2001
ACM
CoIL challenge 2000 was a supervised learning contest that attracted 43 entries. The authors of 29 entries later wrote explanations of their work. This paper discusses these repor...
KDD
2001
ACM
15 years 25 days ago
2001
ACM
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
KDD
2001
ACM
15 years 25 days 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...
KDD
2001
ACM
15 years 25 days ago
2001
ACM
KDD
2001
ACM
15 years 25 days 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...
KDD
2001
ACM
15 years 25 days ago
2001
ACM
KDD
2001
ACM
15 years 25 days 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...
KDD
2001
ACM
2001
ACM
Gaining insights into support vector machine pattern classifiers using projection-based tour methods
15 years 25 days ago
KDD
2001
ACM
15 years 25 days 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...