Sciweavers

2137 search results - page 264 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
CVPR
2010
IEEE
14 years 5 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...
OTM
2009
Springer
14 years 3 months ago
LinksB2N: Automatic Data Integration for the Semantic Web
Abstract. The ongoing trend towards open data embraced by the Semantic Web has started to produce a large number of data sources. These data sources are published using RDF vocabul...
Manuel Salvadores, Gianluca Correndo, Bene Rodrigu...
APVIS
2009
13 years 10 months ago
HiMap: Adaptive visualization of large-scale online social networks
Visualizing large-scale online social network is a challenging yet essential task. This paper presents HiMap, a system that visualizes it by clustered graph via hierarchical group...
Lei Shi, Nan Cao, Shixia Liu, Weihong Qian, Li Tan...
ACIVS
2009
Springer
14 years 1 months ago
A New Feasible Approach to Multi-dimensional Scale Saliency
In this paper, we present a multi-dimensional extension of an image feature extractor, the scale saliency algorithm by Kadir and Brady. In order to avoid the curse of dimensionalit...
Pablo Suau, Francisco Escolano
ICDM
2005
IEEE
271views Data Mining» more  ICDM 2005»
14 years 2 months ago
HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence
In this work, we introduce the new problem of finding time series discords. Time series discords are subsequences of a longer time series that are maximally different to all the r...
Eamonn J. Keogh, Jessica Lin, Ada Wai-Chee Fu