409 search results - page 31 / 82 » Compact Similarity Joins |
KDD
2001
ACM
14 years 8 months ago
2001
ACM
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
ICTAI
2009
IEEE
14 years 2 months ago
2009
IEEE
Existing density-based data stream clustering algorithms use a two-phase scheme approach consisting of an online phase, in which raw data is processed to gather summary statistics...
WWW
2010
ACM
13 years 7 months ago
2010
ACM
To improve the search results for socially-connect users, we propose a ranking framework, Social Network Document Rank (SNDocRank). This framework considers both document contents...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
We introduce Pulse, a framework for processing continuous queries over models of continuous-time data, which can compactly and accurately represent many real-world activities and p...
ADBIS
2007
Springer
14 years 1 months ago
2007
Springer
In solving the classification problem in relational data mining, traditional methods, for example, the C4.5 and its variants, usually require data transformations from datasets sto...