Sciweavers

174 search results - page 32 / 35
» Probabilistic frequent itemset mining in uncertain databases
Sort
View
KDD
2006
ACM
183views Data Mining» more  KDD 2006»
14 years 8 months ago
Discovering interesting patterns through user's interactive feedback
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
Dong Xin, Xuehua Shen, Qiaozhu Mei, Jiawei Han
ICDE
2000
IEEE
112views Database» more  ICDE 2000»
14 years 9 months ago
DEMON: Mining and Monitoring Evolving Data
Data mining algorithms have been the focus of much research recently. In practice, the input data to a data mining process resides in a large data warehouse whose data is kept up-...
Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishn...
ICDE
2008
IEEE
133views Database» more  ICDE 2008»
14 years 2 months ago
Discovering popular co-cited communities in blogspaces
In a blogspace, citation behaviors reflect interests of bloggers. To fully get insight into the latent information in a blogspace, in this paper, we intend to mine popular co-cit...
Meng-Fen Chiang, Wen-Chih Peng, Chia-Hao Lo
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
14 years 8 months ago
Web usage mining based on probabilistic latent semantic analysis
The primary goal of Web usage mining is the discovery of patterns in the navigational behavior of Web users. Standard approaches, such as clustering of user sessions and discoveri...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...