732 search results - page 48 / 147 » Efficient Frequent Pattern Mining in Relational Databases |
KDD
2005
ACM
14 years 8 months ago
2005
ACM
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
DATAMINE
2006
13 years 7 months ago
2006
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
ICDE
2005
IEEE
14 years 9 months ago
2005
IEEE
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
DEXA
2008
Springer
13 years 9 months ago
2008
Springer
The usage of descriptive data mining methods for predictive purposes is a recent trend in data mining research. It is well motivated by the understandability of learned models, the...