Sciweavers

3212 search results - page 7 / 643
» Faster Concept Analysis
Sort
View
SDM
2004
SIAM
163views Data Mining» more  SDM 2004»
13 years 11 months ago
Basic Association Rules
Previous approaches for mining association rules generate large sets of association rules. Such sets are difficult for users to understand and manage. Here, the concept of a restri...
Guichong Li, Howard J. Hamilton
ISSTA
2004
ACM
14 years 3 months ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 10 months ago
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
Johan M. M. van Rooij, Hans L. Bodlaender
ICDM
2008
IEEE
115views Data Mining» more  ICDM 2008»
14 years 4 months ago
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
Jingu Kim, Haesun Park
P2P
2008
IEEE
14 years 4 months ago
Faster Content Access in KAD
Many different Distributed Hash Tables (DHTs) have been designed, but only few have been successfully deployed. The implementation of a DHT needs to deal with practical aspects (e...
Moritz Steiner, Damiano Carra, Ernst W. Biersack