Sciweavers

69 search results - page 10 / 14
» Efficient Runtime Generation of Association Rules
Sort
View
ICWN
2008
13 years 9 months ago
Progressive Content-Sensitive Data Retrieval in Sensor Networks
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
Bo Yang, Mareboyana Manohar, Shaoying Kou
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 8 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
IQIS
2004
ACM
14 years 28 days ago
Mining for Patterns in Contradictory Data
Information integration is often faced with the problem that different data sources represent the same set of the real-world objects, but give conflicting values for specific prop...
Heiko Müller, Ulf Leser, Johann Christoph Fre...
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
HICSS
2003
IEEE
171views Biometrics» more  HICSS 2003»
14 years 24 days ago
Improving the Efficiency of Interactive Sequential Pattern Mining by Incremental Pattern Discovery
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...
Ming-Yen Lin, Suh-Yin Lee