Sciweavers

245 search results - page 37 / 49
» Efficient Algorithms for Discovering Association Rules
Sort
View
DATAMINE
2006
88views more  DATAMINE 2006»
13 years 7 months ago
Hyperclique pattern discovery
Existing algorithms for mining association patterns often rely on the support-based pruning strategy to prune a combinatorial search space. However, this strategy is not effective ...
Hui Xiong, Pang-Ning Tan, Vipin Kumar
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 8 months ago
Interestingness of frequent itemsets using Bayesian networks as background knowledge
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
Szymon Jaroszewicz, Dan A. Simovici
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
14 years 9 months ago
Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data
on Uncertain Data (Extended Abstract) Ming Hua Jian Pei Wenjie Zhang Xuemin Lin Simon Fraser University, Canada The University of New South Wales & NICTA {mhua, jpei}@cs.sfu.c...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
ADAPTIVE
2007
Springer
14 years 1 months ago
Data Mining for Web Personalization
Abstract. In this chapter we present an overview of Web personalization process viewed as an application of data mining requiring support for all the phases of a typical data minin...
Bamshad Mobasher
DASFAA
2005
IEEE
166views Database» more  DASFAA 2005»
14 years 1 months ago
NNF: An Effective Approach in Medicine Paring Analysis of Traditional Chinese Medicine Prescriptions
Medicine Paring Analysis is one of the most important tasks in the research of Traditional Chinese Medicine Prescriptions. The most essential and difficult step is to mine associat...
Chuan Li, Changjie Tang, Jing Peng, Jianjun Hu, Yo...