Sciweavers

292 search results - page 19 / 59
» A Partition-Based Approach to Graph Mining
Sort
View
DEXAW
2009
IEEE
131views Database» more  DEXAW 2009»
14 years 3 months ago
Clustering of Short Strings in Large Databases
—A novel method CLOSS intended for textual databases is proposed. It successfully identifies misspelled string clusters, even if the cluster border is not prominent. The method ...
Michail Kazimianec, Arturas Mazeika
DMIN
2006
151views Data Mining» more  DMIN 2006»
13 years 10 months ago
Rough Set Theory: Approach for Similarity Measure in Cluster Analysis
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
Shuchita Upadhyaya, Alka Arora, Rajni Jain
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 8 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang
AUSDM
2006
Springer
93views Data Mining» more  AUSDM 2006»
14 years 6 days 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
2012
SIAM
278views Data Mining» more  SDM 2012»
11 years 11 months ago
Legislative Prediction via Random Walks over a Heterogeneous Graph
In this article, we propose a random walk-based model to predict legislators’ votes on a set of bills. In particular, we first convert roll call data, i.e. the recorded votes a...
Jun Wang, Kush R. Varshney, Aleksandra Mojsilovic