Sciweavers

265 search results - page 44 / 53
» Approximation algorithms for clustering uncertain data
Sort
View
DATAMINE
2006
142views more  DATAMINE 2006»
14 years 9 months ago
Sequential Pattern Mining in Multi-Databases via Multiple Alignment
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
Hye-Chung Kum, Joong Hyuk Chang, Wei Wang 0010
81
Voted
ICDM
2003
IEEE
225views Data Mining» more  ICDM 2003»
15 years 2 months ago
Combining the web content and usage mining to understand the visitor behavior in a web site
A web site is a semi structured collection of different kinds of data, whose motivation is show relevant information to visitor and by this way capture her/his attention. Understa...
Juan D. Velásquez, Hiroshi Yasuda, Terumasa...
DICTA
2003
14 years 10 months ago
Fast Adaptive Algorithm for Time-Critical Color Quantization Application
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
Kiattisin Kanjanawanishkul, Bunyarit Uyyanonvara
JACM
2010
208views more  JACM 2010»
14 years 8 months ago
The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies
clustering of documents according to sharing of topics at multiple levels of abstraction. Given a corpus of documents, a posterior inference algorithm finds an approximation to a ...
David M. Blei, Thomas L. Griffiths, Michael I. Jor...
CVPR
2008
IEEE
15 years 3 months ago
Normalized tree partitioning for image segmentation
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
Jingdong Wang, Yangqing Jia, Xian-Sheng Hua, Chang...