Finding topic-level experts in scholarly networks.
Saved in:
| Title: | Finding topic-level experts in scholarly networks. |
|---|---|
| Authors: | Lin, Lili1 linlili@hhu.edu.cn, Xu, Zhuoming1, Ding, Ying2, Liu, Xiaozhong3 |
| Source: | Scientometrics. Dec2013, Vol. 97 Issue 3, p797-819. 23p. |
| Subjects: | Expert computer system software, Cooperative research, Personal information management, Systems design, Information retrieval, Comparative studies, Algorithms |
| Abstract: | Expert finding is of vital importance for exploring scientific collaborations to increase productivity by sharing and transferring knowledge within and across different research areas. Expert finding methods, including content-based methods, link structure-based methods, and a combination of content-based and link structure-based methods, have been studied in recent years. However, most state-of-the-art expert finding approaches have usually studied candidates’ personal information (e.g. topic relevance and citation counts) and network information (e.g. citation relationship) separately, causing some potential experts to be ignored. In this paper, we propose a topical and weighted factor graph model that simultaneously combines all the possible information in a unified way. In addition, we also design the Loopy Max-Product algorithm and related message-passing schedules to perform approximate inference on our cycle-containing factor graph model. Information Retrieval is chosen as the test field to identify representative authors for different topics within this area. Finally, we compare our approach with three baseline methods in terms of topic sensitivity, coverage rate of SIGIR PC (e.g. Program Committees or Program Chairs) members, and Normalized Discounted Cumulated Gain scores for different rankings on each topic. The experimental results demonstrate that our factor graph-based model can definitely enhance the expert-finding performance. [ABSTRACT FROM AUTHOR] |
| Copyright of Scientometrics is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 91929847 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Finding topic-level experts in scholarly networks. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Lin%2C+Lili%22">Lin, Lili</searchLink><relatesTo>1</relatesTo><i> linlili@hhu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Xu%2C+Zhuoming%22">Xu, Zhuoming</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Ding%2C+Ying%22">Ding, Ying</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Liu%2C+Xiaozhong%22">Liu, Xiaozhong</searchLink><relatesTo>3</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Scientometrics%22">Scientometrics</searchLink>. Dec2013, Vol. 97 Issue 3, p797-819. 23p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Expert+computer+system+software%22">Expert computer system software</searchLink><br /><searchLink fieldCode="DE" term="%22Cooperative+research%22">Cooperative research</searchLink><br /><searchLink fieldCode="DE" term="%22Personal+information+management%22">Personal information management</searchLink><br /><searchLink fieldCode="DE" term="%22Systems+design%22">Systems design</searchLink><br /><searchLink fieldCode="DE" term="%22Information+retrieval%22">Information retrieval</searchLink><br /><searchLink fieldCode="DE" term="%22Comparative+studies%22">Comparative studies</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Expert finding is of vital importance for exploring scientific collaborations to increase productivity by sharing and transferring knowledge within and across different research areas. Expert finding methods, including content-based methods, link structure-based methods, and a combination of content-based and link structure-based methods, have been studied in recent years. However, most state-of-the-art expert finding approaches have usually studied candidates’ personal information (e.g. topic relevance and citation counts) and network information (e.g. citation relationship) separately, causing some potential experts to be ignored. In this paper, we propose a topical and weighted factor graph model that simultaneously combines all the possible information in a unified way. In addition, we also design the Loopy Max-Product algorithm and related message-passing schedules to perform approximate inference on our cycle-containing factor graph model. Information Retrieval is chosen as the test field to identify representative authors for different topics within this area. Finally, we compare our approach with three baseline methods in terms of topic sensitivity, coverage rate of SIGIR PC (e.g. Program Committees or Program Chairs) members, and Normalized Discounted Cumulated Gain scores for different rankings on each topic. The experimental results demonstrate that our factor graph-based model can definitely enhance the expert-finding performance. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Scientometrics is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=91929847 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s11192-013-0988-6 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 23 StartPage: 797 Subjects: – SubjectFull: Expert computer system software Type: general – SubjectFull: Cooperative research Type: general – SubjectFull: Personal information management Type: general – SubjectFull: Systems design Type: general – SubjectFull: Information retrieval Type: general – SubjectFull: Comparative studies Type: general – SubjectFull: Algorithms Type: general Titles: – TitleFull: Finding topic-level experts in scholarly networks. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Lin, Lili – PersonEntity: Name: NameFull: Xu, Zhuoming – PersonEntity: Name: NameFull: Ding, Ying – PersonEntity: Name: NameFull: Liu, Xiaozhong IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 12 Text: Dec2013 Type: published Y: 2013 Identifiers: – Type: issn-print Value: 01389130 Numbering: – Type: volume Value: 97 – Type: issue Value: 3 Titles: – TitleFull: Scientometrics Type: main |
| ResultId | 1 |