Sciweavers

245 search results - page 35 / 49
» Efficient Algorithms for Discovering Association Rules
Sort
View
WEBI
2005
Springer
14 years 1 months ago
Efficient Extraction of Closed Motivic Patterns in Multi-Dimensional Symbolic Representations of Music
In this paper, we present an efficient model for discovering repeated patterns in symbolic representations of music. Combinatorial redundancy inherent to the pattern discovery pa...
Olivier Lartillot
AUSAI
2003
Springer
14 years 24 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
ADMA
2006
Springer
131views Data Mining» more  ADMA 2006»
14 years 1 months ago
Distance Guided Classification with Gene Expression Programming
Gene Expression Programming (GEP) aims at discovering essential rules hidden in observed data and expressing them mathematically. GEP has been proved to be a powerful tool for cons...
Lei Duan, Changjie Tang, Tianqing Zhang, Dagang We...
DAWAK
2010
Springer
13 years 8 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar
CEAS
2008
Springer
13 years 9 months ago
Reducing E-Discovery Cost by Filtering Included Emails
As businesses become more reliance on information technology, electronic information is often produced as vital evidence during civil litigation. The process of discovering electr...
Tsuen-Wan Ngan