Sciweavers

30 search results - page 6 / 6
» Finding Maximal Fully-Correlated Itemsets in Large Databases
Sort
View
ICDE
2006
IEEE
139views Database» more  ICDE 2006»
14 years 6 months ago
MiniCount: Efficient Rewriting of COUNT-Queries Using Views
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
Prodromos Malakasiotis, Václav Lín, ...
DAWAK
2007
Springer
13 years 11 months ago
Mining Top-K Multidimensional Gradients
Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing g...
Ronnie Alves, Orlando Belo, Joel Ribeiro
BMCBI
2007
141views more  BMCBI 2007»
13 years 5 months ago
Reconstruction of human protein interolog network using evolutionary conserved network
Background: The recent increase in the use of high-throughput two-hybrid analysis has generated large quantities of data on protein interactions. Specifically, the availability of...
Tao-Wei Huang, Chung-Yen Lin, Cheng-Yan Kao
ICDE
2007
IEEE
175views Database» more  ICDE 2007»
14 years 6 months ago
Dynamic Batch Nearest Neighbor Search in Video Retrieval
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
Jie Shao, Zi Huang, Heng Tao Shen, Xiaofang Zhou, ...
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
14 years 5 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han