|
Title
|
|
|
|
Cartification : from similarities to itemset frequencies
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| Suppose we are given a multi-dimensional dataset. For every point in the dataset, we create a transaction, or cart, in which we store the k-nearest neighbors of that point for one of the given dimensions. The resulting collection of carts can then be used to mine frequent itemsets; that is, sets of points that are frequently seen together in some dimensions. Experimentation shows that finding clusters, outliers, cluster centers, or even subspace clustering becomes easy on the cartified dataset using state-of-the-art techniques in mining interesting itemsets. |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
Lecture notes in computer science. - Berlin, 1973, currens
| |
|
Publication
|
|
|
|
Berlin
:
2012
| |
|
ISSN
|
|
|
|
0302-9743
[print]
1611-3349
[online]
| |
|
DOI
|
|
|
|
10.1007/978-3-642-29892-9_4
| |
|
Volume/pages
|
|
|
|
7278
(2012)
, p. 4
| |
|
Full text (Publisher's DOI)
|
|
|
|
| |
|