1998 search results - page 191 / 400 » Basic Association Rules |
133
click to vote
WWW
2006
ACM
16 years 4 months ago
2006
ACM
In this work we propose a method that retrieves a list of related queries given an initial input query. The related queries are based on the query log of previously issued queries...
144
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
136
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
143
click to vote
ACSC
2008
IEEE
15 years 10 months ago
2008
IEEE
Recent research initiatives have addressed the need for improved performance of Web page prediction accuracy that would profit many applications, ebusiness in particular. Differ...
199
click to vote
BDIM
2008
IEEE
15 years 10 months ago
2008
IEEE
—Knowing the dependencies among computing assets and services provides insights into the computing and business landscape, therefore, facilitating low-risk timely changes in supp...