Sciweavers

731 search results - page 46 / 147
» Taxonomy-superimposed graph mining
Sort
View
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
13 years 6 months ago
Finding effectors in social networks
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopu...
ASUNAM
2009
IEEE
14 years 25 days ago
Mining the Dynamics of Music Preferences from a Social Networking Site
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...
Nico Schlitter, Tanja Falkowski
TKDE
2011
362views more  TKDE 2011»
13 years 2 months ago
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
Luh Yen, Marco Saerens, François Fouss
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 11 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
14 years 8 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth