Proceedings of the 3rd IKDD Conference on Data Science, 2016 2016
DOI: 10.1145/2888451.2888473
|View full text |Cite
|
Sign up to set email alerts
|

Competing Algorithm Detection from Research Papers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 1 publication
0
2
0
Order By: Relevance
“…Candidate Phrase Extraction: To limit the search space of phrases, we propose to use noun phrases present in the Title and Abstract of document d as candidate phrases. For citation contexts, named entities form a better set of candidates as shown by (Ganguly and Pudi, 2016). However different named entities can be linked to different papers cited in the same citation context.…”
Section: Approach 21 Concept Extractionmentioning
confidence: 99%
See 1 more Smart Citation
“…Candidate Phrase Extraction: To limit the search space of phrases, we propose to use noun phrases present in the Title and Abstract of document d as candidate phrases. For citation contexts, named entities form a better set of candidates as shown by (Ganguly and Pudi, 2016). However different named entities can be linked to different papers cited in the same citation context.…”
Section: Approach 21 Concept Extractionmentioning
confidence: 99%
“…So it becomes essential to first identify which entity e corresponds to which cited paper cp and then use the proposed algorithm to classify e as aim/method/result for the corresponding paper cp. For the above purpose, we use entity-citation linking algorithm (Ganguly and Pudi, 2016). The matching function iterates over entities and citations to get their closeness score.…”
Section: Approach 21 Concept Extractionmentioning
confidence: 99%