1768 search results - page 226 / 354 » Mining Very Large Databases |
136
Voted
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analy...
135
Voted
SDM
2009
SIAM
16 years 29 days ago
2009
SIAM
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
164
Voted
SIGMOD
2000
ACM
15 years 8 months ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
153
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
This paper presents a new algorithm for sequence prediction over long categorical event streams. The input to the algorithm is a set of target event types whose occurrences we wis...
131
Voted
KAIS
2008
15 years 3 months ago
2008
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...