Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
CAEP: Classification by Aggregating Emerging Patterns
DS '99 Proceedings of the Second International Conference on Discovery Science
Implicit manipulation of polynomials using zero-suppressed BDDs
EDTC '95 Proceedings of the 1995 European conference on Design and Test
IEEE Transactions on Knowledge and Data Engineering
The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams
A survey of collaborative filtering techniques
Advances in Artificial Intelligence
Breaking out of the box of recommendations: from items to packages
Proceedings of the fourth ACM conference on Recommender systems
Recommendation systems with complex constraints: A course recommendation perspective
ACM Transactions on Information Systems (TOIS)
VSOP (valued-sum-of-products) calculator for knowledge processing based on zero-suppressed BDDs
Proceedings of the 2005 international conference on Federation over the Web
Hi-index | 0.00 |
In this paper, we present a set recommendation framework that proposes sets of items, whereas conventional recommendation methods recommend each item independently. Our new approach to the set recommendation framework can propose sets of items on the basis on the user's initially chosen set. In this approach, items are added to or deleted from the initial set so that the modified set matches the target classification. Since the data sets created by the latest applications can be quite large, we use ZDD (Zero-suppressed Binary Decision Diagram) to make the searching more efficient. This framework is applicable to a wide range of applications such as advertising on the Internet and healthy life advice based on personal lifelog data.