Sciweavers

310 search results - page 29 / 62
» High-Dimensional Similarity Joins
Sort
View
AAAI
2010
13 years 10 months ago
Kernelized Sorting for Natural Language Processing
Kernelized sorting is an approach for matching objects from two sources (or domains) that does not require any prior notion of similarity between objects across the two sources. U...
Jagadeesh Jagarlamudi, Seth Juarez, Hal Daum&eacut...
ECEASST
2010
13 years 6 months ago
Self Organized Swarms for cluster preserving Projections of high-dimensional Data
: A new approach for topographic mapping, called Swarm-Organized Projection (SOP) is presented. SOP has been inspired by swarm intelligence methods for clustering and is similar to...
Alfred Ultsch, Lutz Herrmann
KDD
1998
ACM
102views Data Mining» more  KDD 1998»
14 years 27 days ago
Joins that Generalize: Text Classification Using WHIRL
WHIRL is an extensionof relational databasesthat canperform "soft joins" basedon the similarity of textual identifiers;thesesoftjoins extendthe traditional operationof j...
William W. Cohen, Haym Hirsh
COLING
2010
13 years 3 months ago
Simple and Efficient Algorithm for Approximate Dictionary Matching
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
Naoaki Okazaki, Jun-ichi Tsujii
SBBD
2001
119views Database» more  SBBD 2001»
13 years 10 months ago
The Dimension-Join: A New Index for Data Warehouses
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...
Pedro Bizarro, Henrique Madeira