41 search results - page 5 / 9 » Clustering Large Attributed Graphs: An Efficient Incremental... |
NIPS
2004
14 years 11 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
BIRTHDAY
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. The error-prone process of formal specification and verification of large systems requires an efficient, evolutionary formal development approach. Development graphs have...
104
click to vote
TVCG
2008
14 years 9 months ago
2008
Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In thi...
SEMWEB
2010
Springer
14 years 7 months ago
2010
Springer
OWL 2 RL was standardized as a less expressive but scalable subset of OWL 2 that allows a forward-chaining implementation. However, building an enterprise-scale forward-chaining ba...
PKDD
2010
Springer
14 years 7 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...