Sciweavers

165 search results - page 27 / 33
» Discovering Frequent Closed Itemsets for Association Rules
Sort
View
ICDE
2009
IEEE
176views Database» more  ICDE 2009»
14 years 9 months ago
Discovering Conditional Functional Dependencies
This paper investigates the discovery of conditional functional dependencies (CFDs). CFDs are a recent extension of functional dependencies (FDs) by supporting patterns of semantic...
Wenfei Fan, Floris Geerts, Laks V. S. Lakshmanan, ...
BMCBI
2007
147views more  BMCBI 2007»
13 years 7 months ago
Predicting combinatorial binding of transcription factors to regulatory elements in the human genome by association rule mining
Background: Cis-acting transcriptional regulatory elements in mammalian genomes typically contain specific combinations of binding sites for various transcription factors. Althoug...
Xochitl C. Morgan, Shulin Ni, Daniel P. Miranker, ...
ICMLA
2009
13 years 5 months ago
All-Monotony: A Generalization of the All-Confidence Antimonotony
Abstract--Many studies have shown the limits of support/confidence framework used in Apriori-like algorithms to mine association rules. One solution to cope with this limitation is...
Yannick Le Bras, Philippe Lenca, Sorin Moga, St&ea...
JIIS
2006
124views more  JIIS 2006»
13 years 7 months ago
An efficient approach to mining indirect associations
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
Qian Wan, Aijun An
CORR
2010
Springer
132views Education» more  CORR 2010»
13 years 7 months ago
ETP-Mine: An Efficient Method for Mining Transitional Patterns
A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior o...
B. Kiran Kumar