A weighted-tree similarity algorithm for multi-agent systems in e-Business environments

Computational Intelligence

Volumn 20, Issue 4, 2004, Pages 584-602

  Bhavsar, Virendrakumar C ^a   Boley, Harold ^a,b   Yang, L U ^a  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b NATIONAL RESEARCH COUNCIL CANADA   (Canada)

Author keywords

Arc labeled trees; Arc weighted trees; Buyer seller matching; e Business; e Learning; Multi agent system; Object Oriented RuleML; Relfun; Similarity measure

Indexed keywords

ALGORITHMS; ELECTRONIC COMMERCE; OBJECT ORIENTED PROGRAMMING; RECURSIVE FUNCTIONS; SEMANTICS; TREES (MATHEMATICS); XML;

ARC-LABELED TREES; ARC-WEIGHTED TREES; BUYER-SELLER MATCHING; E-BUSINESS; E-LEARNING; SIMILARITY MEASURE;

MULTI AGENT SYSTEMS;

EID: 8344260547     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.0824-7935.2004.00255.x     Document Type: Article

References (21)

1. BOLEY, H. 1999. Functional-logic integration via minimal reciprocal extensions. In Theoretical Computer Science,Vol. 212, Elsevier, Amsterdam, pp. 77-99.
2. BOLEY, H. 2003. Object-oriented RuleML: User-level roles. In URI-Grounded Clauses and Order-Sorted Terms. Springer-Verlag, Heidelberg, LNCS-2876, pp. 1-16.
3. BOLEY, H., V. C. BHAVSAR, D. HIRTLE, A. SINGH, Z. SUN, and L. YANG. 2005. A Match-Making System for Learners and Learning Objects. Learning & Leading with Technology, International Society for Technology in Education, Eugene, OR (to appear).
4. CANCORE. 2003. CanCore guidelines version 1.9: educational category. Accessed on January 30, 2004. http://www.cancore.org/guidelines/1.9/ CanCore_guidelines_Educational_1.9.pdf.
5. CHAVEZ, A., and P. MAES. 1996. Kasbah: An agent marketplace for buying and selling goods. In Proceedings of the First International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology, London, pp. 75-90.
6. HAMMING, R. W. 1986. Error-correcting codes. In Coding and Information Theory (Second Edition). Prentice-Hall, Englewood Cliffs, NJ.
7. KAMAT, V. N. 1996. Inductive learning with the evolving tree transformation system. Ph.D. thesis, Faculty of Computer Science, University of New Brunswick, Fredericton, Canada.
8. KIFER, M., G. LAUSEN, and J. WU. 1995. Logical foundations of object-oriented and frame-based languages. JACM, 42(4):741-843.
9. LASSILA, O., and R. R. SWICK. 1999. Resource description framework (RDF) model and syntax specification. Recommendation REC-rdf-syntax-19990222, W3C.
10. LIU, T., and D. GEIGER. 1999. Approximate tree matching and shape similarity. In Proceedings of the Seventh International Conference on Computer Vision, Kerkyra, pp. 456-462.
11. LU, S. 1979. A tree-to-tree distance and its application to cluster analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-1(2):219-224.
12. MARSH, S., A. GHORBANI, and V. C. BHAVSAR. 2003. The ACORN multi-agent system. Web Intelligence and Agent Systems, 1(1):1-21.
13. RICHTER, M. M. 2001. Case-Based Reasoning: past, present, and future. Invited Futures Talk, International Conference on Case-Based Reasoning (ICCBR-2001), Vancouver, British Columbia, Canada.
14. SARNO, R., L. YANG, V. C. BHAVSAR, and H. BOLEY. 2003. The AgentMatcher architecture applied to power grid transactions. In Proceedings of the First International Workshop on Knowledge Grid and Grid Intelligence, Halifax, pp. 92-99.
15. SCHINDLER, B., F. ROTHLAUF, and H. J. PESCH. 2002. Evolution strategies, network random keys, and the one-max tree problem. In Applications of Evolutionary Computing: EvoWorkshops. Edited by Stefano Cagnoni, Jens Gottlieb, Emma Hart, Martin Middendorf, and Gunther R. Raidl. Springer,Vol. 2279 of LNCS, pp. 143-152.
16. SHASHA, D., J. WANG, and K. ZHANG. 1994. Exact and approximate algorithm for unordered tree matching. IEEE Transactions on Systems, Man and Cybernetics, 24(4):668-678.
17. SHASHA, D., J. WANG, and K. ZHANG. 2001. Treediff: Approximate tree matcher for ordered trees. Accessed on October 20, 2003. http://www.cs.nyu.edu/ cs/faculty/shasha/papers/tree.html.
18. SYCARA, K., M. PAOLUCCI, M. VAN VELSEN, and J. A. GIAMPAPA. 2001. The RETSINA MAS infrastructure. Robotics Institute, Carnegie Mellon University, CMU-RI-TR-01-05.
19. TOGNERI, R., and C. J. S. DESILVA. 2002. Fundamentals of channel coding. In Fundamentals of Information Theory and Coding Design. Chapman & Hall/CRC, Boca Raton.
20. WANG, J., B. A. SHAPIRO, D. SHASHA, K. ZHANG, and K. M. CURREY. 1998. An algorithm for finding the largest approximately common substructures of two trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20:889-895.
21. YANG, Q., C. CARRICK, J. LAM, Y. WANG, and H. ZHANG. 2000. Exploiting intelligent agents and data mining for e-Commerce. In Electronic Commerce Technology Trends. Edited by W. Kou and Yesha. IBM Press, pp. 115-134.