Co-operation framework of case-based reasoning agents for automated product recommendation

Date

2005-09-01

Author

Baykal, MO
Alhajj, R
Polat, Faruk

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

174
views

0
downloads

This paper proposes a co-operation framework for multiple role-based case-based reasoning (CBR) agents to handle the product recommendation problem for e-commerce applications. Each agent has different case structure with intersecting features and agents exploit all information related to the problem by co-operation, which is accomplished through the merge of distributed cases in order to form cases having better representation of the problem. The presented merge algorithm handles noisy distributed cases by negotiation on the difference values of the intersecting features. The role-based CBR agents merge the distributed cases by introducing a global heuristic function, which is used to evaluate the relevance of merged cases. The heuristic function exploits the relevancy of each merged case within the viewpoint of each agent and the satisfied/unsatisfied problem constraints. The viewpoint of an agent is represented by the value of consistency of distributed components of merged cases and agent s individual relevance values of the merged cases. Finally, the proposed framework has been tested for elective course recommendation.

Subject Keywords

Theoretical Computer Science, Software, Artificial Intelligence

URI

https://hdl.handle.net/11511/48021

Journal

JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE

DOI

https://doi.org/10.1080/09528130500112429

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

AN EFFICIENT DATABASE TRANSITIVE CLOSURE ALGORITHM Toroslu, İsmail Hakkı; HENSCHEN, L (Springer Science and Business Media LLC, 1994-05-01) The integration of logic rules and relational databases has recently emerged as an important technique for developing knowledge management systems. An important class of logic rules utilized by these systems is the so-called transitive closure rules, the processing of which requires the computation of the transitive closure of database relations referenced by these rules. This article presents a new algorithm suitable for computing the transitive closure of very large database relations. This algorithm proc...
Managing business lifecycle using ebIOP Tambag, Y; Coşar, Ahmet (Wiley, 2003-11-10) In this paper, we describe how ebIOP (an ebXML compliant B2B interoperability platform) manages the business lifecycle by providing an example scenario. ebIOP provides a common storage for ebIOP components (ebXML applications). ebIOP defines an ebIOP component to be a software implementation of one or more ebXML specifications which is a solution of an e-commerce pattern (description of an e-commerce problem). ebIOP contains a server that listens to a port over the TCP/IP protocol for client requests and pr...
Semantic information-based alternative plan generation for multiple query optimization Polat, Faruk; Alhajj, R (Elsevier BV, 2001-09-01) This paper addresses the impact of semantic information about queries on alternative plan generation (APG) for multiple query optimization (MQO). MQO covers optimizing the execution of a set of queries together where each query in the set to be optimized has several alternative execution plans. A multiple query optimizer selects an alternative plan for each query to obtain an optimal global execution plan. Our approach uses information such as common relations, common possible joins and common conditions to...
A Bayesian network framework for project cost, benefit and risk analysis with an agricultural development case study Yet, Barbaros; Fenton, Norman; Neil, Martin; Luedeling, Eike; Shepherd, Keith (Elsevier BV, 2016-10-01) Successful implementation of major projects requires careful management of uncertainty and risk. Yet such uncertainty is rarely effectively calculated when analysing project costs and benefits. This paper presents a Bayesian Network (BN) modelling framework to calculate the costs, benefits, and return on investment of a project over a specified time period, allowing for changing circumstances and trade-offs. The framework uses hybrid and dynamic BNs containing both discrete and continuous variables over mul...
Composing semantic Web services under constraints Karakoc, E.; Karagöz, Pınar (Elsevier BV, 2009-10-01) Web service composition is an inevitable aspect of Web services technology, which solves complex problems by combining available basic services and ordering them to best suit the problem requirements. Automatic composition gives us flexibility of selecting best candidate services at composition time satisfying QoS requirements: this would require the user to define constraints for selecting and composing candidate Web services. In this work, a Web service composition approach is presented in which a rich se...

Citation Formats

M. Baykal, R. Alhajj, and F. Polat, “Co-operation framework of case-based reasoning agents for automated product recommendation,” JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, pp. 201–220, 2005, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/48021.