Sciweavers

74 search results - page 3 / 15
» Initialization of Iterative Refinement Clustering Algorithms
Sort
View
BMVC
2010
13 years 2 months ago
Saliency Segmentation based on Learning and Graph Cut Refinement
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...
Paria Mehrani, Olga Veksler
ESWA
2010
158views more  ESWA 2010»
13 years 4 months ago
Interval competitive agglomeration clustering algorithm
1 In this study, a novel robust clustering algorithm, robust interval competitive agglomeration (RICA) clustering algorithm, is proposed to overcome the problems of the outliers, t...
Jin-Tsong Jeng, Chen-Chia Chuang, Chin-Wang Tao
PAKDD
2010
ACM
134views Data Mining» more  PAKDD 2010»
13 years 9 months ago
A Robust Seedless Algorithm for Correlation Clustering
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
Mohammad S. Aziz, Chandan K. Reddy
WWW
2008
ACM
14 years 8 months ago
Pivotbrowser: a tag-space image searching prototype
We propose a novel iterative searching and refining prototype for tagged images. This prototype, named PivotBrowser, captures semantically similar tag sets in a structure called p...
Xiaoyan Li, Lidan Shou, Gang Chen, Xiaolong Zhang,...
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 7 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis