Sciweavers

292 search results - page 31 / 59
» A Partition-Based Approach to Graph Mining
Sort
View
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 3 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
JBI
2007
110views Bioinformatics» more  JBI 2007»
13 years 8 months ago
FreeViz - An intelligent multivariate visualization approach to explorative analysis of biomedical data
Visualization can largely improve biomedical data analysis. It plays a crucial role in explorative data analysis and may support various data mining tasks. The paper presents Free...
Janez Demsar, Gregor Leban, Blaz Zupan
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
14 years 3 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
ICDM
2006
IEEE
129views Data Mining» more  ICDM 2006»
14 years 2 months ago
Keyword Generation for Search Engine Advertising
Keyword3 generation for search engine advertising is an important problem for sponsored search or paidplacement advertising. A recent strategy in this area is bidding on nonobviou...
Amruta Joshi, Rajeev Motwani
WSDM
2010
ACM
199views Data Mining» more  WSDM 2010»
14 years 5 months ago
A Sketch-Based Distance Oracle for Web-Scale Graphs
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork,...