Sciweavers

478 search results - page 56 / 96
» Measuring the Similarity of Labeled Graphs
Sort
View
WCE
2007
15 years 5 months ago
Novel Auxiliary Techniques in Clustering
— Clustering is grouping of patterns according to similarity or distance in different perspectives. Various data representations, similarity measurements and organization manners...
Mohammad Taheri, Reza Boostani
ICPR
2006
IEEE
16 years 5 months ago
A General Framework for Agglomerative Hierarchical Clustering Algorithms
This paper presents a general framework for agglomerative hierarchical clustering based on graphs. Specifying an inter-cluster similarity measure, a subgraph of the similarity gra...
Reynaldo Gil-García, José Manuel Bad...
STACS
2004
Springer
15 years 9 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
CVPR
2008
IEEE
16 years 6 months ago
Non-negative graph embedding
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...
Jianchao Yang, Shuicheng Yan, Yun Fu, Xuelong Li, ...
WWW
2006
ACM
16 years 5 months ago
Discovering event evolution graphs from newswires
In this paper, we propose an approach to automatically mine event evolution graphs from newswires on the Web. Event evolution graph is a directed graph in which the vertices and e...
Christopher C. Yang, Xiaodong Shi