Sciweavers

63 search results - page 9 / 13
» Discovering frequent topological structures from graph datas...
Sort
View
EDBT
2006
ACM
159views Database» more  EDBT 2006»
14 years 7 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 9 months ago
Patterns of Cascading Behavior in Large Blog Graphs
How do blogs cite and influence each other? How do such links evolve? Does the popularity of old blog posts drop exponentially with time? These are some of the questions that we ...
Jure Leskovec, Mary McGlohon, Christos Faloutsos, ...
ICANN
2009
Springer
14 years 2 days ago
Constrained Learning Vector Quantization or Relaxed k-Separability
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
Marek Grochowski, Wlodzislaw Duch
WWW
2003
ACM
14 years 8 months ago
Mining newsgroups using networks arising from social behavior
Recent advances in information retrieval over hyperlinked corpora have convincinglydemonstratedthat links carry less noisy information than text. We investigate the feasibility of...
Rakesh Agrawal, Sridhar Rajagopalan, Ramakrishnan ...
VISSYM
2007
13 years 10 months ago
Grouse: Feature-Based, Steerable Graph Hierarchy Exploration
Grouse is a feature-based approach to steerable exploration of a graph and an associated hierarchy. Steerability allows exploration to begin immediately, rather than requiring a c...
Daniel Archambault, Tamara Munzner, David Auber