Sciweavers

292 search results - page 33 / 59
» A Partition-Based Approach to Graph Mining
Sort
View
SDM
2004
SIAM
163views Data Mining» more  SDM 2004»
13 years 9 months ago
Basic Association Rules
Previous approaches for mining association rules generate large sets of association rules. Such sets are difficult for users to understand and manage. Here, the concept of a restri...
Guichong Li, Howard J. Hamilton
ICDM
2003
IEEE
136views Data Mining» more  ICDM 2003»
14 years 1 months ago
Statistical Relational Learning for Document Mining
A major obstacle to fully integrated deployment of many data mining algorithms is the assumption that data sits in a single table, even though most real-world databases have compl...
Alexandrin Popescul, Lyle H. Ungar, Steve Lawrence...
CVPR
2010
IEEE
14 years 4 months ago
Object-Graphs for Context-Aware Category Discovery
How can knowing about some categories help us to discover new ones in unlabeled images? Unsupervised visual category discovery is useful to mine for recurring objects without huma...
Yong Jae Lee, Kristen Grauman
KDD
2007
ACM
155views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining templates from search result records of search engines
Metasearch engine, Comparison-shopping and Deep Web crawling applications need to extract search result records enwrapped in result pages returned from search engines in response ...
Hongkun Zhao, Weiyi Meng, Clement T. Yu
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
13 years 6 months ago
Laplacian Spectrum Learning
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
Pannagadatta K. Shivaswamy, Tony Jebara