3172 search results - page 238 / 635 » New developments of the Z-EDM algorithm |
190
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
157
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
163
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
168
click to vote
DASFAA
2009
IEEE
16 years 1 months ago
2009
IEEE
Recently, due to its wide applications, (similar) subgraph search has attracted a lot of attentions from database and data mining community, such as [13, 18, 19, 5]. In [8], Ke et ...
157
click to vote
SPAA
2006
ACM
16 years 12 days ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...