Classifying Expertise in a Special Interest Group Knowledge Portal Using a Point-Based Semi-Automatic Expertise (PBASE) Method

Chapter (PDF Available) · March 2010with24 Reads
DOI: 10.5772/9535 · Source: InTech
In book: Knowledge Management
Instead of using the conventional way to classify users based on the number of posts, this research proposes a two-way classification method called Point-Based Semi-automatic Expertise (PBASE). By proposing the PBASE method, we hope to maximize the capability of SIG knowledge portal for the convenience of its community members to seek help among the members. Furthermore, we have identified that there is a limitation in identifying the type of posts. Based on the current approach, users are required to state the type of post. Thus as part of the future work, we plan to integrate Natural Language Processing (NLP) technique with PBASE. Hence, users will no longer need to state the type of post since NLP will automatically analyze and identify the type of posts. Other future work include that the system should suggest automatically to other members list of people who in the same area or expert. In other word it involves either expert system or decision support system concept.


Full-text (PDF)

Available from: Sarina Sulaiman, Mar 04, 2015
  • Book · Jan 2005 · ACM Computing Surveys
  • [Show abstract] [Hide abstract] ABSTRACT: Knowledge management solutions relying on central repositories some- times have not met expectations, since users often create knowledge ad-hoc using their individual vocabulary and using their own individual IT infrastructure (e.g., their laptop). The introduction of the peer-to-peer paradigm to knowledge man- agement is currently seen as a promising technology to overcome this challenge. A major problem within peer-to-peer systems is to find the best peer given a cer- tain query. In this paper we introduce three semantic overlay layers which can be used to score the known peers according to their probability to answer a query. We here consider queries for documents organized in a topic hierarchy. Since, the peer selection problem is very similar to the task of finding an expert within an organization, the algorithms can also be used in such a scenario.
    Full-text · Conference Paper · Jan 2005 · ACM Computing Surveys
  • [Show abstract] [Hide abstract] ABSTRACT: graph, consisting of a set of abstract nodes (the pages) joined by directional edges (the hyperlinks). Hyperlinks encode a considerable amount,of latent information about the the underlying collection of pages; thus, the structure of this directed graph can provide us with significant insight into its content. Within this framework, we can search for signs of meaningful graph-theoretic structure; we can ask: What are the recurring patterns of linkage that occur across the Web as a whole? The profound complexity of the WWW is a crucial challenge in this search for structure. Content on the
    Article · Dec 1999
Show more