13 search results - page 2 / 3 » T-Trees, Vertical Partitioning and Distributed Association R... |
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Data mining can extract important knowledge from large data collections - but sometimes these collections are split among various parties. Privacy concerns may prevent the parties...
ADMA
2008
Springer
14 years 18 days ago
2008
Springer
To avoid the loss of semantic information due to the partition of quantitative values, this paper proposes a novel algorithm, called MPSQAR, to handle the quantitative association ...
DGO
2007
13 years 7 months ago
2007
We present D-HOTM, a framework for Distributed Higher Order Text Mining based on named entities extracted from textual data that are stored in distributed relational databases. Unl...
SIGMOD
1997
ACM
13 years 10 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
SPAA
1997
ACM
13 years 10 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...