544 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author김상욱-
dc.date.accessioned2017-11-17T01:02:28Z-
dc.date.available2017-11-17T01:02:28Z-
dc.date.issued2016-01-
dc.identifier.citationINFORMATION SCIENCES, v. 326, Page. 25-40en_US
dc.identifier.issn0020-0255-
dc.identifier.issn1872-6291-
dc.identifier.urihttp://www.sciencedirect.com/science/article/pii/S0020025515005320-
dc.identifier.urihttp://hdl.handle.net/20.500.11754/31479-
dc.description.abstractAs the number of people who use scientific literature databases has grown, the demand for literature retrieval services has steadily increased. One of the most popular retrieval service methods is to find a set of papers similar to the paper under consideration, which requires a measure that computes the similarities between the papers. Scientific literature databases exhibit two interesting characteristics that are not found in general databases. First, the papers cited by older papers are often not included in the database due to technical and economic reasons. Second, since a paper references previously published papers, few papers cite recently published papers. These two characteristics cause all existing similarity measures to fail in at least one of the following cases: (1) measuring the similarity between old, but similar papers, (2) measuring the similarity between recent, but similar papers, and (3) measuring the similarity between two similar papers: one old, the other recent. In this paper, we propose a new link-based similarity measure called C-Rank, which uses both in-link and out-link references, disregarding the direction of the references. In addition, we discuss the most suitable normalization method for scientific literature databases and we propose an evaluation method for measuring the accuracy of similarity measures. For the experiments, we used real-world papers from DBLP's database with reference information crawled from Libra. We then compared the performance of C-Rank with that of existing similarity measures. Experimental results showed that C-Rank achieved a higher accuracy than existing similarity measures. (C) 2015 Elsevier Inc. All rights reserved.en_US
dc.description.sponsorshipThis work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (No. NRF-2014R1A2A1A10054151) and LG Yonam Foundation.en_US
dc.language.isoenen_US
dc.publisherELSEVIER SCIENCE INCen_US
dc.subjectScientific literatureen_US
dc.subjectLink-based similarity measureen_US
dc.titleC-Rank: A link-based similarity measure for scientific literature databasesen_US
dc.typeArticleen_US
dc.relation.volume326-
dc.identifier.doi10.1016/j.ins.2015.07.036-
dc.relation.page25-40-
dc.relation.journalINFORMATION SCIENCES-
dc.contributor.googleauthorYoon, Seok-Ho-
dc.contributor.googleauthorKim, Sang-Wook-
dc.contributor.googleauthorPark, Sunju-
dc.relation.code2016002598-
dc.sector.campusS-
dc.sector.daehakCOLLEGE OF ENGINEERING[S]-
dc.sector.departmentDEPARTMENT OF COMPUTER SCIENCE-
dc.identifier.pidwook-
dc.identifier.orcidhttp://orcid.org/0000-0002-6345-9084-
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > COMPUTER SCIENCE AND ENGINEERING(컴퓨터공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE