作者: Athanasios K. Tsakalidis , Christos H. Makris , Ioannis N. Kouris
DOI: 10.1016/J.DATAK.2004.07.004
关键词:
摘要: The classic two-stepped approach of the Apriori algorithm and its descendants, which consisted finding all large itemsets then using these to generate association rules has worked well for certain categories data. Nevertheless many other data types this shows highly degraded performance proves rather inefficient.We argue that we need search space candidate but let database unveil secrets as customers use it. We propose a system does not merely scan possible combinations itemsets, acts like engine specifically implemented making recommendations techniques borrowed from Information Retrieval.