An Efficient Ontology-Based Expert Peering System
Description
This paper proposes a novel expert peering system for information exchange. Our objective is to develop a real-time search engine for an online community where users can query experts, who are simply other participating users knowledgeable in that area, for help on various topics.We consider a graph-based scheme consisting of an ontology tree where each node represents a (sub)topic. Consequently, the fields of expertise or profiles of the participating experts correspond to subtrees of this ontology. Since user queries can also be mapped to similar tree structures, assigning queries to relevant experts becomes a problem of graph matching. A serialization of the ontology tree allows us to use simple dot products on the ontology vector space effectively to address this problem. As a demonstrative example, we conduct extensive experiments with different parameterizations. We observe that our approach is efficient and yields promising results.
| Slides | |
| 0:00 | An Efficient Ontology-Based Expert Peering System |
| 0:54 | Outline |
| 0:58 | Overview |
| 2:01 | The Ontology |
| 3:02 | Mapping to Ontology-space (1) |
| 3:40 | Mapping to Ontology-space (2) |
| 4:19 | Methods Properties |
| 5:07 | Experiment Setup (1) |
| 6:11 | Experiment Setup (2) |
| 6:35 | Numerical Results (1) |
| 7:23 | Numerical Results (2) |
| 8:12 | Observations |
| 9:08 | Application |
| 9:38 | Architecture |
| 12:16 | Conclusion |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





