Sciweavers

4972 search results - page 177 / 995
» Ranking on graph data
Sort
View
GD
2006
Springer
15 years 10 months ago
Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
Ulrik Brandes, Christian Pich
ICDM
2006
IEEE
149views Data Mining» more  ICDM 2006»
16 years 19 days ago
Pattern Mining in Frequent Dynamic Subgraphs
Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowl...
Karsten M. Borgwardt, Hans-Peter Kriegel, Peter Wa...
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
15 years 8 months ago
Metric forensics: a multi-level approach for mining volatile graphs
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
Keith Henderson, Tina Eliassi-Rad, Christos Falout...
ICASSP
2010
IEEE
15 years 5 months ago
Unidirectional graph-based wavelet transforms for efficient data gathering in sensor networks
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
Sunil K. Narang, Godwin Shen, Antonio Ortega
ADMA
2005
Springer
144views Data Mining» more  ADMA 2005»
16 years 4 days ago
One Dependence Augmented Naive Bayes
In real-world data mining applications, an accurate ranking is same important to a accurate classification. Naive Bayes (simply NB) has been widely used in data mining as a simple...
Liangxiao Jiang, Harry Zhang, Zhihua Cai, Jiang Su