Sciweavers

1314 search results - page 71 / 263
» Approximate data mining in very large relational data
Sort
View
DAWAK
2004
Springer
15 years 7 months ago
A Tree Partitioning Method for Memory Management in Association Rule Mining
All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first com...
Shakil Ahmed, Frans Coenen, Paul H. Leng
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
16 years 2 months ago
Privacy-Preserving Sharing of Horizontally-Distributed Private Data for Constructing Accurate Classifiers
Data mining tasks such as supervised classification can often benefit from a large training dataset. However, in many application domains, privacy concerns can hinder the construc...
Vincent Yan Fu Tan, See-Kiong Ng
TCS
2008
15 years 1 months ago
Itemset frequency satisfiability: Complexity and axiomatization
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
Toon Calders
EDBT
2010
ACM
145views Database» more  EDBT 2010»
15 years 5 months ago
Splash: ad-hoc querying of data and statistical models
Data mining is increasingly performed by people who are not computer scientists or professional programmers. It is often done as an iterative process involving multiple ad-hoc tas...
Lujun Fang, Kristen LeFevre
ICDM
2005
IEEE
135views Data Mining» more  ICDM 2005»
15 years 7 months ago
Bit Reduction Support Vector Machine
Abstract— Support vector machines are very accurate classifiers and have been widely used in many applications. However, the training and to a lesser extent prediction time of s...
Tong Luo, Lawrence O. Hall, Dmitry B. Goldgof, And...