Ranking Related Research Papers Based on Citation Graph
Research papers are of great importance for researchers to record and share their ideas, studies and results. Meanwhile, they are the bases for further research work. Finding related research papers is the preliminary of good research. A new method for ranking related research papers is introduced i...
        Saved in:
      
    
          | Published in | 东华大学学报(英文版) Vol. 31; no. 2; pp. 128 - 132 | 
|---|---|
| Main Author | |
| Format | Journal Article | 
| Language | English | 
| Published | 
            Institute of Massive Computing, Software Engineering, East China Normal University, Shanghai 200062, China
    
        2014
     | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 1672-5220 | 
Cover
| Summary: | Research papers are of great importance for researchers to record and share their ideas, studies and results. Meanwhile, they are the bases for further research work. Finding related research papers is the preliminary of good research. A new method for ranking related research papers is introduced in this paper. Given a set of interested papers, the method proposed in this paper may rank related papers just based on a citation graph by constructing the minimal Steiner trees. The method can work with the existing keyword based methods. Intensive experiments on a specific research topic show that the proposed method provides a different ranking criterion to existing ones, and can effectively retrieve those highly related papers. | 
|---|---|
| Bibliography: | 31-1920/N Research papers are of great importance for researchers to record and share their ideas, studies and results. Meanwhile, they are the bases for further research work. Finding related research papers is the preliminary of good research. A new method for ranking related research papers is introduced in this paper. Given a set of interested papers, the method proposed in this paper may rank related papers just based on a citation graph by constructing the minimal Steiner trees. The method can work with the existing keyword based methods. Intensive experiments on a specific research topic show that the proposed method provides a different ranking criterion to existing ones, and can effectively retrieve those highly related papers. CAI A-ni , GONG Xue-qing , QIAN Wei-ning , ZHOU Ao-ying( Institute of Massive Computing, Software Engineering, East China Normal University, Shanghai 200062, China) research paper; citation graph; Steiner tree  | 
| ISSN: | 1672-5220 |