Sciweavers

4009 search results - page 163 / 802
» Clustering on Complex Graphs
Sort
View
JSS
2007
121views more  JSS 2007»
15 years 3 months ago
Opportunistic prioritised clustering framework for improving OODBMS performance
In object oriented database management systems, clustering has proven to be one of the most effective performance enhancement techniques. Existing clustering algorithms are mainly...
Zhen He, Richard Lai, Alonso Marquez, Stephen Blac...
ICMT
2009
Springer
15 years 10 months ago
A Collection Operator for Graph Transformation
Abstract. Graph transformation has a well-established theory and associated tools that can be used to perform model transformations. However, the lack of a construct to match and t...
Roy Grønmo, Stein Krogdahl, Birger Mø...
JMLR
2011
87views more  JMLR 2011»
14 years 11 months ago
CARP: Software for Fishing Out Good Clustering Algorithms
This paper presents the CLUSTERING ALGORITHMS’ REFEREE PACKAGE or CARP, an open source GNU GPL-licensed C package for evaluating clustering algorithms. Calibrating performance o...
Volodymyr Melnykov, Ranjan Maitra
KDD
2004
ACM
136views Data Mining» more  KDD 2004»
16 years 4 months ago
Exploring the community structure of newsgroups
d Abstract] Christian Borgs Jennifer Chayes Mohammad Mahdian Amin Saberi We propose to use the community structure of Usenet for organizing and retrieving the information stored i...
Christian Borgs, Jennifer T. Chayes, Mohammad Mahd...
CORR
2012
Springer
176views Education» more  CORR 2012»
13 years 11 months ago
Capturing Topology in Graph Pattern Matching
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...