Sciweavers

731 search results - page 103 / 147
» Taxonomy-superimposed graph mining
Sort
View
SAC
2009
ACM
14 years 2 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
PAMI
2010
103views more  PAMI 2010»
13 years 6 months ago
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...
Amin Mantrach, Luh Yen, Jérôme Callut...
BMCBI
2008
149views more  BMCBI 2008»
13 years 7 months ago
All-paths graph kernel for protein-protein interaction extraction with evaluation of cross-corpus learning
Background: Automated extraction of protein-protein interactions (PPI) is an important and widely studied task in biomedical text mining. We propose a graph kernel based approach ...
Antti Airola, Sampo Pyysalo, Jari Björne, Tap...
TKDE
2008
125views more  TKDE 2008»
13 years 7 months ago
Discovering and Explaining Abnormal Nodes in Semantic Graphs
An important problem in the area of homeland security is to identify abnormal or suspicious entities in large datasets. Although there are methods from data mining and social netwo...
Shou-de Lin, Hans Chalupsky
SENSYS
2005
ACM
14 years 1 months ago
TSAR: a two tier sensor storage architecture using interval skip graphs
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems a...
Peter Desnoyers, Deepak Ganesan, Prashant J. Sheno...