Sciweavers

1413 search results - page 28 / 283
» Mining Multiple Large Databases
Sort
View
CORR
2004
Springer
146views Education» more  CORR 2004»
13 years 7 months ago
Mining Frequent Itemsets from Secondary Memory
Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically for main memory databases. In this paper, we investigate a...
Gösta Grahne, Jianfei Zhu
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 14 days ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
ADC
2006
Springer
120views Database» more  ADC 2006»
14 years 1 months ago
Approximate data mining in very large relational data
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...
James C. Bezdek, Richard J. Hathaway, Christopher ...
KDD
1995
ACM
216views Data Mining» more  KDD 1995»
13 years 11 months ago
Robust Decision Trees: Removing Outliers from Databases
Finding and removingoutliers is an important problem in data mining. Errors in large databases can be extremely common,so an important property of a data mining algorithm is robus...
George H. John
KDD
2002
ACM
150views Data Mining» more  KDD 2002»
14 years 8 months ago
Querying multiple sets of discovered rules
Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a sma...
Alexander Tuzhilin, Bing Liu