Sciweavers

220 search results - page 27 / 44
» Measures of Clustering Quality: A Working Set of Axioms for ...
Sort
View
DKE
2007
105views more  DKE 2007»
13 years 7 months ago
On compressing frequent patterns
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
WWW
2011
ACM
13 years 2 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
LREC
2008
174views Education» more  LREC 2008»
13 years 9 months ago
UnsuParse: unsupervised Parsing with unsupervised Part of Speech Tagging
Based on simple methods such as observing word and part of speech tag co-occurrence and clustering, we generate syntactic parses of sentences in an entirely unsupervised and self-...
Christian Hänig, Stefan Bordag, Uwe Quasthoff
ICCV
2005
IEEE
14 years 9 months ago
Creating Efficient Codebooks for Visual Recognition
Visual codebook based quantization of robust appearance descriptors extracted from local image patches is an effective means of capturing image statistics for texture analysis and...
Bill Triggs, Frédéric Jurie
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
13 years 9 months ago
A Compression Based Distance Measure for Texture
The analysis of texture is an important subroutine in application areas as diverse as biology, medicine, robotics, and forensic science. While the last three decades have seen ext...
Bilson J. L. Campana, Eamonn J. Keogh