Sciweavers

262 search results - page 33 / 53
» Generalized Closed Itemsets for Association Rule Mining
Sort
View
KAIS
2008
114views more  KAIS 2008»
15 years 1 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 6 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
HPCC
2007
Springer
15 years 8 months ago
A Data Imputation Model in Sensor Databases
Data missing is a common problem in database query processing, which can cause bias or lead to inefficient analyses, and this problem happens more often in sensor databases. The re...
Nan Jiang
HT
2006
ACM
15 years 7 months ago
Hyperlink assessment based on web usage mining
One of the basic methods of web usage mining are association rules that indicate relationships among common use of web pages. Positive and confined negative association rules are ...
Przemyslaw Kazienko, Marcin Pilarczyk
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
15 years 7 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