Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/1114
Title: Intelligent Product Brokering for E-Commerce: An Incremental Approach to Unaccounted Attribute Detection
Authors: Guan, SU
Tan, PC
Chan, TK
Keywords: Unaccounted Attributes, Genetic Algorithm, Product-Brokering Agent
Issue Date: 2004
Publisher: Elsevier
Citation: Sheng-Uei Guan, Ping Cheng Tan and Tai Kheng Chan, “Intelligent Product Brokering for E-Commerce: An Incremental Approach to Unaccounted Attribute Detection”, 232-252, Vol. 3, Issue 3, Electronic Commerce and Research Applications, 2004; DOI http://dx.doi.org/10.1016/j.elerap.2003.10.001
Abstract: This research concentrates on designing generic product-brokering agent to understand user preference towards a product category and recommends a list of products to the user according to the preference captured by the agent. The proposed solution is able to detect both quantifiable and non-quantifiable attributes through a user feedback system. Unlike previous approaches, this research allows the detection of unaccounted attributes that are not within the ontology of the system. No tedious change of the algorithm, database, or ontology is required when a new product attribute is introduced. This approach only requires the attribute to be within the description field of the product. The system analyzes the general product descriptions field and creates a list of candidate attributes affecting the user’s preference. A genetic algorithm verifies these candidate attributes and excess attributes are identified and filtered off. A prototype has been created and our results show positive results in the detection of unaccounted attributes affecting a user.
URI: http://bura.brunel.ac.uk/handle/2438/1114
Appears in Collections:Electronic and Computer Engineering
Dept of Electronic and Computer Engineering Research Papers

Files in This Item:
File Description SizeFormat 
Intelligent Product Brokering for E-Commerce -.pdf887.44 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.