Sciweavers

731 search results - page 37 / 147
» Taxonomy-superimposed graph mining
Sort
View
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 9 months ago
Clustering by weighted cuts in directed graphs
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
Marina Meila, William Pentney
PPL
2007
126views more  PPL 2007»
13 years 7 months ago
Challenges in Parallel Graph Processing
Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel c...
Andrew Lumsdaine, Douglas Gregor, Bruce Hendrickso...
PREMI
2005
Springer
14 years 1 months ago
Towards Generic Pattern Mining
Frequent Pattern Mining (FPM) is a very powerful paradigm for mining informative and useful patterns in massive, complex datasets. In this paper we propose the Data Mining Template...
Mohammed Javeed Zaki, Nilanjana De, Feng Gao, Nage...
23
Voted
AUSDM
2006
Springer
93views Data Mining» more  AUSDM 2006»
13 years 11 months ago
Visualisation and Exploration of Scientific Data Using Graphs
Abstract. We present a prototype application for graph-based data exploration and mining, with particular emphasis on scientific data. The application has a Flash-based graphical i...
Ben Raymond, Lee Belbin
SDM
2009
SIAM
104views Data Mining» more  SDM 2009»
14 years 4 months ago
On Randomness Measures for Social Networks.
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
Xiaowei Ying, Xintao Wu