Sciweavers

227 search results - page 13 / 46
» How Good Is a Kernel When Used as a Similarity Measure
Sort
View
VLDB
2002
ACM
137views Database» more  VLDB 2002»
13 years 7 months ago
Comparing Data Streams Using Hamming Norms (How to Zero In)
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthu...
PODS
2008
ACM
211views Database» more  PODS 2008»
14 years 7 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
KDD
2005
ACM
109views Data Mining» more  KDD 2005»
14 years 7 months ago
Formulating distance functions via the kernel trick
Tasks of data mining and information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be for...
Gang Wu, Edward Y. Chang, Navneet Panda
RANLP
2003
13 years 8 months ago
Roget's thesaurus and semantic similarity
Roget’s Thesaurus has not been sufficiently appreciated in Natural Language Processing. We show that Roget's and WordNet are birds of a feather. In a few typical tests, we ...
Mario Jarmasz, Stan Szpakowicz
SNPD
2004
13 years 8 months ago
Using extended phylogenetc profiles and support vector machines for protein family classification
We proposed a new approach to compare profiles when the correlations among attributes can be represented as a tree. To account for these correlations, the profile is extended with...
Kishore Narra, Li Liao