1 Weighted-Tree Simplicity Algorithm for Similarity Matching of Partial Product Descriptions Lu Yang, Biplab Sarker, Virendra C. Bhavsar and Harold Boley.

Slides:



Advertisements
Similar presentations
Chapter 5: Tree Constructions
Advertisements

Alyce Brady CS 470: Data Structures CS 510: Computer Algorithms Post-order Traversal: Left Child - Right Child - Root Depth-First Search.
Every edge is in a red ellipse (the bags). The bags are connected in a tree. The bags an original vertex is part of are connected.
2012: J Paul GibsonT&MSP: Mathematical FoundationsMAT7003/L2-GraphsAndTrees.1 MAT 7003 : Mathematical Foundations (for Software Engineering) J Paul Gibson,
Efficient Keyword Search for Smallest LCAs in XML Database Yu Xu Department of Computer Science & Engineering University of California, San Diego Yannis.
Binary Trees Chapter 6. Linked Lists Suck By now you realize that the title to this slide is true… By now you realize that the title to this slide is.
Graphs By JJ Shepherd. Introduction Graphs are simply trees with looser restrictions – You can have cycles Historically hard to deal with in computers.
B+-Trees (PART 1) What is a B+ tree? Why B+ trees? Searching a B+ tree
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
Creating Concept Hierarchies in a Customer Self-Help System Bob Wall CS /29/05.
G. Gottlob, C. Koch & R. Pichler TU Wien, Vienna, Austria Elias Politarhos Advanced Databases M.Sc. in Information Systems Athens University of Economics.
DEPARTMENT OF COMPUTER SCIENCE SOFTWARE ENGINEERING, GRAPHICS, AND VISUALIZATION RESEARCH GROUP 15th International Conference on Information Visualisation.
Web Mining Research: A Survey
B + -Trees (Part 1) Lecture 20 COMP171 Fall 2006.
CS 206 Introduction to Computer Science II 12 / 10 / 2008 Instructor: Michael Eckmann.
CS 206 Introduction to Computer Science II 11 / 09 / 2009 Instructor: Michael Eckmann.
CS 261 – Winter 2010 Trees. Ubiquitous – they are everywhere in CS Probably ranks third among the most used data structure: 1.Vectors and Arrays 2.Lists.
CS 206 Introduction to Computer Science II 02 / 11 / 2009 Instructor: Michael Eckmann.
XML –Query Languages, Extracting from Relational Databases ADVANCED DATABASES Khawaja Mohiuddin Assistant Professor Department of Computer Sciences Bahria.
Week 7 - Wednesday.  What did we talk about last time?  Recursive running time  Master Theorem  Introduction to trees.
Advanced Topics in Algorithms and Data Structures 1 An example.
Systematic Analysis of Interactome: A New Trend in Bioinformatics KOCSEA Technical Symposium 2010 Young-Rae Cho, Ph.D. Assistant Professor Department of.
1 B-Trees Section AVL (Adelson-Velskii and Landis) Trees AVL tree is binary search tree with balance condition –To ensure depth of the tree is.
1 LOMGen: A Learning Object Metadata Generator Applied to Computer Science Terminology A. Singh, H. Boley, V.C. Bhavsar National Research Council and University.
XML-to-Relational Schema Mapping Algorithm ODTDMap Speaker: Artem Chebotko* Wayne State University Joint work with Mustafa Atay,
Data Structures Arrays both single and multiple dimensions Stacks Queues Trees Linked Lists.
B-trees (Balanced Trees) A B-tree is a special kind of tree, similar to a binary tree. However, It is not a binary search tree. It is not a binary tree.
©Silberschatz, Korth and Sudarshan12.1Database System Concepts B + -Tree Index Files Indexing mechanisms used to speed up access to desired data.  E.g.,
Advanced Algorithms Analysis and Design Lecture 8 (Continue Lecture 7…..) Elementry Data Structures By Engr Huma Ayub Vine.
1 A Weighted-Tree Similarity Algorithm for Multi-Agent Systems in e-Business Environments Virendra C.Bhavsar* Harold Boley** Lu Yang* * Faculty of Computer.
A Level Computer Science Topic 9: Data Structures T eaching L ondon C omputing William Marsh School of Electronic Engineering and Computer Science Queen.
AgentMatcher Search in Weighted, Tree-Structured Learning Object Metadata H. Boley, V.C. Bhavsar, D. Hirtle, A. Singh, Z. Sun and L. Yang National Research.
Web Search. Structure of the Web n The Web is a complex network (graph) of nodes & links that has the appearance of a self-organizing structure  The.
CSCE350 Algorithms and Data Structure Lecture 17 Jianjun Hu Department of Computer Science and Engineering University of South Carolina
1 Weighted Partonomy-Taxonomy Trees with Local Similarity Measures for Semantic Buyer-Seller Matchmaking By: Lu Yang March 16, 2005.
1 Lu Yang, Biplab Sarker, Virendrakumar C. Bhavsar and Harold Boley Faculty of Computer Science University of New Brunswick (UNB) Fredericton,
Keyword Searching and Browsing in Databases using BANKS Seoyoung Ahn Mar 3, 2005 The University of Texas at Arlington.
1 Weighted Partonomy-Taxonomy Trees with Local Similarity Measures for Semantic Buyer-Seller Match-Making Lu Yang, Marcel Ball, Virendra C. Bhavsar and.
1 Le Thi Thu Thuy*, Doan Dai Duong*, Virendrakumar C. Bhavsar* and Harold Boley** * Faculty of Computer Science, University of New Brunswick, Fredericton,
Compiled by: Dr. Mohammad Omar Alhawarat
Weighted Slotted RuleML for Similarity Matching in AgentMatcher Information Agents Harold Boley, NRC IIT e-Business Virendra Bhavsar, UNB, Faculty of Computer.
The AgentMatcher Architecture Applied to Power Grid Transactions Riyanarto Sarno Faculty of Information Technology, Sepuluh Nopember Institute of Technology.
Data Structures TREES.
Trees : Part 1 Section 4.1 (1) Theory and Terminology (2) Preorder, Postorder and Levelorder Traversals.
Min Chen School of Computer Science and Engineering Seoul National University Data Structure: Chapter 6.
Rooted Tree a b d ef i j g h c k root parent node (self) child descendent leaf (no children) e, i, k, g, h are leaves internal node (not a leaf) sibling.
Red Black Trees Top-Down Deletion. Recall the rules for BST deletion 1.If vertex to be deleted is a leaf, just delete it. 2.If vertex to be deleted has.
Lecture 17: Trees and Networks I Discrete Mathematical Structures: Theory and Applications.
Example: Expressions Python Programming, 2/e 1 [+, [*, 3, 5], [*, 2, [-, 6, 1]]]
Week 7 - Wednesday.  What did we talk about last time?  Recursive running time  Master Theorem  Symbol tables.
1 Trees What is a Tree? Tree terminology Why trees? What is a general tree? Implementing trees Binary trees Binary tree implementation Application of Binary.
1 Holistic Twig Joins: Optimal XML Pattern Matching Nicolas Bruno, Nick Koudas, Divesh Srivastava ACM SIGMOD 2002 Presented by Jun-Ki Min.
TREES General trees Binary trees Binary search trees AVL trees Balanced and Threaded trees.
1 The tree data structure Outline In this topic, we will cover: –Definition of a tree data structure and its components –Concepts of: Root, internal, and.
MCS Thesis By: Sébastien Mathieu Supervisors: Dr. Virendra C. Bhavsar and Dr. Harold Boley Examining Board: Dr. John DeDourek, Dr. Weichang Du, Dr. Donglei.
Chapter 6 – Trees. Notice that in a tree, there is exactly one path from the root to each node.
Chapter 11 Indexing And Hashing (1) Yonsei University 1 st Semester, 2016 Sanghyun Park.
What is a Tree? Formally, we define a tree T as a set of nodes storing elements such that the nodes have a parent-child relationship, that satisfies the.
Code: BCA302 Data Structures with C Prof. (Dr.) Monalisa Banerjee By.
Using ODP Metadata to Personalize Search Presented by Lan Nie 09/21/2005, Lehigh University.
CSCE 210 Data Structures and Algorithms
Trees.
CHAPTER 4 Trees.
ITEC 2620M Introduction to Data Structures
Trees 4 The B-Tree Section 4.7
ITEC 2620M Introduction to Data Structures
Personal Assistants for the Web: An MIT Perspective
Keyword Searching and Browsing in Databases using BANKS
Principles of Computing – UFCFA3-30-1
Trees-2, Graphs Data Structures with C Chpater-6 Course code: 10CS35
Presentation transcript:

1 Weighted-Tree Simplicity Algorithm for Similarity Matching of Partial Product Descriptions Lu Yang, Biplab Sarker, Virendra C. Bhavsar and Harold Boley IASSE Talk, July 21, 2005

2 Outline Buyer-Seller AgentMatcher in e-Markets Product Descriptions : Arc-Labeled, Arc-Weighted Trees Tree Similarity Tree Simplicity Computational Results Use Case Conclusion

3 Buyer-Seller AgentMatcher in e-Markets Main Server User Info User Profiles User Agents … … Agents … … e-Market To other sites (network) Web Browser User Matcher 1 Matcher n

4 Buyer-Seller AgentMatcher in e-Markets Seller RankSimilarity n Recommendations for a buyer Buyer 1Seller 1 Buyer 2 Seller m Seller 2 Matcher i Buyer n

5 Product Descriptions : Arc-Labeled, Arc-Weighted Trees 0.8 Car Ford Sedan 10000SmallTaurusV Category Year Make Engine Model Size Kms Buyer TreeSeller Tree 0.4 Car Ford Sedan SmallTaurus 2000 Category Year Make Model Size Kms Scenario: Used-car buying/selling Similarity = missing subtree Missing subtree represents partial product description

6 Tree Similarity Algorithm Recursively traverse (sub)trees top-down Compute similarity bottom-up S(T 1, T 2 ) =  S i (w i + w' i )/2 When a subtree of a tree is missing in the other tree, compute the simplicity of the subtree

7 Tree simplicity measure computes the simplicity of a single (sub)tree Tree simplicity contributes to tree similarity Takes into account: Arc weights Out-going degree of non-leaf nodes (tree breadth) Depth of leaf nodes Wider and deeper trees lead to smaller tree simplicity values Tree Simplicity Algorithm (Cont’d)

8 : the simplicity value of a single tree T : depth degradation index : depth degradation factor d : depth of a leaf node m : root node degree of tree T that is not a leaf node w j : arc weight of the j th outgoing arc from the root node of tree T T j : subtree connected to the j th arc with arc weight w j Tree Simplicity Algorithm (Cont’d) if T is a leaf node, otherwise.

9 Tree Simplicity — Extreme Cases The simplest tree is a single-node tree with simplicity 1.0 The most complex tree is an infinite tree (our previous tree complexity measure made the tree complexity go toward infinite in this case) Š(T) = 0 or Š(T) = 0 or

10 Tree Simplicity — Example A B F b CDE c d e f g hij GHI J d DIDI Š(T) = (0.2· Š(T B ) +0.1· Š(T C ) + 0.3· Š(T D ) + 0.4· Š(T E ) ) Š(T) = Š(T E ) =(0.5 · Š(T I ) +0.5 · Š(T J ) ) Š(T B ) = (0.8 · Š(T F ) +0.1 · Š(T G ) · Š(T H ) ) = =

11 Tree Simplicity — Analysis of k-ary trees A A1A1 l1l1 1/k lklk AkAk k-ary tree k-ary trees: Each node (except the leaf nodes) has k children Each path from the root to a leaf node has the same length

12 Computational Results Simplicity as a function of depth d

13 Simplicity as a function of root-node degree k Computational Results

14 Simplicity as a function of root-node degree k and depth d Computational Results

15 Use Case — Learning Object Tree classification lom taxonpath 1.0 taxon Applied Sciences, Technology classification -set taxon- set general title language en Introduction To Oracle general- set keyword keyword -set database lifeCycle Contribute- set 1.0 educational language learning Resource Type 0.2 context 0.2 educational- set intende dEndUs erRole 0.2 typicalAge Range 0.2 course Learner    lifeCycle- set contribute entity  technical rights format technical- set 0.5 copyrightAnd Other Restrictions 0.5 rights- set descriptions 0.5   otherPlatform Requirements oracle 0.5 YesHTML   Don’t care

16 Use Case — Learner Query Tree classification lom taxonpath 1.0 taxon Applied Sciences, Technology classification -set taxon- set lifeCycle Contribute- set 1.0 educational language learning Resource Type 0.2 context 0.2 educational- set intende dEndUs erRole 0.2 typicalAge Range 0.2 course Learner   lifeCycle- set contribute entity  technical rights format technical- set 0.5 copyrightAnd Other Restrictions 0.5 rights- set descriptions 0.5   otherPlatform Requirements NoHTML Similarity = Simplicity =

17 Conclusion Arc-labeled, arc-weighed tree representations for buyer-seller product descriptions Tree similarity measure for buyer-seller matching Allows partial product description Tree simplicity measure for partial product description matching Simpler missing (sub)trees lead to greater simplicity values and thus greater similarity values Applications eduSource: learner and learning object matching Teclantic: project profile matching

18 Thank you! Questions?