Sciweavers

739 search results - page 110 / 148
» Approximate Association Rule Mining
Sort
View
CIKM
2004
Springer
14 years 1 months ago
Discovering frequently changing structures from historical structural deltas of unordered XML
Recently, a large amount of work has been done in XML data mining. However, we observed that most of the existing works focus on the snapshot XML data, while XML data is dynamic i...
Qiankun Zhao, Sourav S. Bhowmick, Mukesh K. Mohani...
KAIS
2006
164views more  KAIS 2006»
13 years 7 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 9 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian
WWW
2001
ACM
14 years 8 months ago
WebLQM : A Web Community Examiner
WebLQM is a system with capabilities to locate, query and mine web communities on the Internet. WebLQM has a special way to define the World Wide Web, its contents and relations. ...
Jesús Ubaldo Quevedo, Shou-Hsuan Stephen Hu...
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