Sciweavers

62 search results - page 10 / 13
» Efficient Data Structures and Parallel Algorithms for Associ...
Sort
View
AUSAI
2003
Springer
14 years 21 days ago
Efficiently Mining Frequent Patterns from Dense Datasets Using a Cluster of Computers
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
Yudho Giri Sucahyo, Raj P. Gopalan, Amit Rudra
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
13 years 11 months ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh
JIIS
2000
111views more  JIIS 2000»
13 years 7 months ago
Multidimensional Index Structures in Relational Databases
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
Christian Böhm, Stefan Berchtold, Hans-Peter ...
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
CNV Workshop: an integrated platform for high-throughput copy number variation discovery and clinical diagnostics
Background: Recent studies have shown that copy number variations (CNVs) are frequent in higher eukaryotes and associated with a substantial portion of inherited and acquired risk...
Xiaowu Gai, Juan C. Perin, Kevin Murphy, Ryan O'Ha...
RCIS
2010
13 years 5 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu