Sciweavers

732 search results - page 121 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
CIARP
2009
Springer
13 years 11 months ago
A Brief Index for Proximity Searching
A large number of computer tasks can be modeled as the search for an object near a given query. From multimedia databases to learning algorithms, data mining and pattern recognitio...
Eric Sadit Tellez, Edgar Chávez, Antonio Ca...
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 7 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
DAWAK
2005
Springer
14 years 1 months ago
Efficient Compression of Text Attributes of Data Warehouse Dimensions
This paper proposes the compression of data in Relational Database Management Systems (RDBMS) using existing text compression algorithms. Although the technique proposed is general...
Jorge Vieira, Jorge Bernardino, Henrique Madeira
KDD
2002
ACM
196views Data Mining» more  KDD 2002»
14 years 8 months ago
Comparing Two Recommender Algorithms with the Help of Recommendations by Peers
Abstract. Since more and more Web sites, especially sites of retailers, offer automatic recommendation services using Web usage mining, evaluation of recommender algorithms has bec...
Andreas Geyer-Schulz, Michael Hahsler
ALMOB
2007
74views more  ALMOB 2007»
13 years 7 months ago
Evaluating deterministic motif significance measures in protein databases
Background: Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in...
Pedro Gabriel Ferreira, Paulo J. Azevedo