Sciweavers

3068 search results - page 38 / 614
» Clustering with Multiple Graphs
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Combining hierarchical clusterings using min-transitive closure
In the past, clusterings combination approaches are based on “flat” clustering algorithms, i.e. algorithms that operate on non-hierarchical clustering schemes. These approache...
Abdolreza Mirzaei, Mohammad Rahmati
ICML
2010
IEEE
13 years 6 months ago
Mining Clustering Dimensions
Many real-world datasets can be clustered along multiple dimensions. For example, text documents can be clustered not only by topic, but also by the author's gender or sentim...
Sajib Dasgupta, Vincent Ng
ECML
2006
Springer
13 years 10 months ago
B-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
Tony Jebara, Vlad Shchogolev
CIKM
2009
Springer
14 years 3 months ago
SPIDER: a system for scalable, parallel / distributed evaluation of large-scale RDF data
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has bee...
Hyunsik Choi, Jihoon Son, YongHyun Cho, Min Kyoung...
VL
2005
IEEE
107views Visual Languages» more  VL 2005»
14 years 2 months ago
Navigating Software Architectures with Constant Visual Complexity
Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...
Wanchun Li, Peter Eades, Seok-Hee Hong