Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Over the last decades, several billion b pages have been made available on the b. The ongoing transition from the current b of unstructured data to the Data b yet requires scalable and accurate approaches for the extraction of structured data in RDF (Resource Description Framework) from these bsites. One of the key steps towards extracting RDF from text is the disambiguation of named entities.  address this issue by presenting AGDISTIS, a novel knowledge-base-agnostic approach for named entity disambiguation. Our approach combines the Hypertext-Induced Topic Search (HITS) algorithm with label expansion strategies and string similarity measures. Based on this combination, AGDISTIS can efficiently detect the correct URIs for a given set of named entities within an input text.
['Ricardo Usbeck', 'Axel-Cyrille Ngonga Ngomo', 'Michael Röder', 'Daniel Gerber', 'Sandro Athaíde Coelho', 'Sören Auer', 'Andreas Both']
I am writing a research paper on a idea AGDISTIS - agnostic disambiguation of named entities using linked open data
[{"from": "human", "value": "I am writing a research paper on a idea AGDISTIS - agnostic disambiguation of named entities using linked open data"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Over the last decades, several billion b pages have been made available on the b. The ongoing transition from the current b of unstructured data to the Data b yet requires scalable and accurate approaches for the extraction of structured data in RDF (Resource Description Framework) from these bsites. One of the key steps towards extracting RDF from text is the disambiguation of named entities.  address this issue by presenting AGDISTIS, a novel knowledge-base-agnostic approach for named entity disambiguation. Our approach combines the Hypertext-Induced Topic Search (HITS) algorithm with label expansion strategies and string similarity measures. Based on this combination, AGDISTIS can efficiently detect the correct URIs for a given set of named entities within an input text."}]