Sciweavers

252 search results - page 50 / 51
» Mining Frequent Patterns without Candidate Generation
Sort
View
KDD
2010
ACM
293views Data Mining» more  KDD 2010»
13 years 9 months ago
BioSnowball: automated population of Wikis
Internet users regularly have the need to find biographies and facts of people of interest. Wikipedia has become the first stop for celebrity biographies and facts. However, Wik...
Xiaojiang Liu, Zaiqing Nie, Nenghai Yu, Ji-Rong We...
CIVR
2007
Springer
180views Image Analysis» more  CIVR 2007»
13 years 11 months ago
Probabilistic matching and resemblance evaluation of shapes in trademark images
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
Helmut Alt, Ludmila Scharf, Sven Scholz
CIKM
2006
Springer
13 years 7 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
GIS
2006
ACM
14 years 6 months ago
Optimization of multiple continuous queries over streaming satellite data
Remotely sensed data, in particular satellite imagery, play many important roles in environmental applications and models. In particular applications that study (rapid) changes in...
Quinn Hart, Michael Gertz
CIKM
2009
Springer
13 years 10 months ago
iMecho: an associative memory based desktop search system
Traditional desktop search engines only support keyword based search that needs exact keyword matching to find resources. However, users generally have a vague picture of what is...
Jidong Chen, Hang Guo, Wentao Wu, Wei Wang 0009