374 search results - page 31 / 75 » New Algorithms for Fast Discovery of Association Rules |
148
click to vote
KES
2004
Springer
15 years 11 months ago
2004
Springer
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
137
click to vote
MOC
1998
15 years 5 months ago
1998
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
170
click to vote
CIKM
2006
Springer
15 years 9 months ago
2006
Springer
This paper presents a simple and adaptable matching method dealing with web directories, catalogs and OWL ontologies. By using a well-known Knowledge Discovery in Databases model,...
186
click to vote
WEA
2010
Springer
16 years 24 days ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
147
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
This paper reports a new general framework of focused web crawling based on "relational subgroup discovery". Predicates are used explicitly to represent the relevance cl...