Sciweavers

573 search results - page 95 / 115
» Mining Frequent Itemsets from Uncertain Data
Sort
View
ICDM
2007
IEEE
197views Data Mining» more  ICDM 2007»
14 years 2 months ago
Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks
Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of...
Ruoming Jin, Scott McCallen, Eivind Almaas
ICCV
2009
IEEE
13 years 5 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden
WSDM
2012
ACM
214views Data Mining» more  WSDM 2012»
12 years 3 months ago
Selecting actions for resource-bounded information extraction using reinforcement learning
Given a database with missing or uncertain content, our goal is to correct and fill the database by extracting specific information from a large corpus such as the Web, and to d...
Pallika H. Kanani, Andrew K. McCallum
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
14 years 8 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
PAKDD
2010
ACM
167views Data Mining» more  PAKDD 2010»
13 years 11 months ago
Resource-Bounded Information Extraction: Acquiring Missing Feature Values on Demand
We present a general framework for the task of extracting specific information “on demand” from a large corpus such as the Web under resource-constraints. Given a database wit...
Pallika Kanani, Andrew McCallum, Shaohan Hu