Sciweavers

292 search results - page 52 / 59
» A Partition-Based Approach to Graph Mining
Sort
View
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 5 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
JCB
2007
118views more  JCB 2007»
13 years 6 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida
ML
2010
ACM
193views Machine Learning» more  ML 2010»
13 years 1 months ago
On the eigenvectors of p-Laplacian
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
Dijun Luo, Heng Huang, Chris H. Q. Ding, Feiping N...
SDM
2011
SIAM
284views Data Mining» more  SDM 2011»
12 years 9 months ago
The Network Completion Problem: Inferring Missing Nodes and Edges in Networks
While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomp...
Myunghwan Kim 0002, Jure Leskovec
WSDM
2009
ACM
114views Data Mining» more  WSDM 2009»
14 years 1 months ago
Wikipedia pages as entry points for book search
A lot of the world’s knowledge is stored in books, which, as a result of recent mass-digitisation efforts, are increasingly available online. Search engines, such as Google Book...
Marijn Koolen, Gabriella Kazai, Nick Craswell