Sciweavers

716 search results - page 43 / 144
» Mining Association Rules from Relational Data - Average Dist...
Sort
View
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
14 years 1 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
APCCM
2006
13 years 9 months ago
Network data mining: methods and techniques for discovering deep linkage between attributes
Network Data Mining identifies emergent networks between myriads of individual data items and utilises special algorithms that aid visualisation of `emergent' patterns and tre...
John Galloway, Simeon J. Simoff
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
14 years 1 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
AUSDM
2008
Springer
221views Data Mining» more  AUSDM 2008»
13 years 10 months ago
Mining Medical Specialist Billing Patterns for Health Service Management
This paper presents an application of association rule mining in compliance in the context of health service management. There are approximately 500 million transactions processed...
Yin Shan, David Jeacocke, D. Wayne Murray, Alison ...
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