. Ilievski, F., Beek, W., van Erp , M., Rietveld, L., & Schlobach, S. LOTUS: Adaptive text search for big linked data, pages 470–485. Springer/Verlag, 2016. doi abstract bibtex Finding relevant resources on the Semantic Web today is a dirty job: no centralized query service exists and the support for natural language access is limited. We present LOTUS: Linked Open Text Un- leaShed, a text-based entry point to a massive subset of today’s Linked Open Data Cloud. Recognizing the use case dependency of resource re- trieval, LOTUS provides an adaptive framework in which a set of match- ing and ranking algorithms are made available. Researchers and develop- ers are able to tune their own LOTUS index by choosing and combining the matching and ranking algorithms that suit their use case best. In this paper, we explain the LOTUS approach, its implementation and the functionality it provides. We demonstrate the ease with which LOTUS enables text-based resource retrieval at an unprecedented scale in con- crete and domain-specific scenarios. Finally, we provide evidence for the scalability of LOTUS with respect to the LOD Laundromat, the largest collection of easily accessible Linked Open Data currently available.
@inbook{f61941f98374409c990fb5f25443b77d,
title = "LOTUS: Adaptive text search for big linked data",
abstract = "Finding relevant resources on the Semantic Web today is a dirty job: no centralized query service exists and the support for natural language access is limited. We present LOTUS: Linked Open Text Un- leaShed, a text-based entry point to a massive subset of today’s Linked Open Data Cloud. Recognizing the use case dependency of resource re- trieval, LOTUS provides an adaptive framework in which a set of match- ing and ranking algorithms are made available. Researchers and develop- ers are able to tune their own LOTUS index by choosing and combining the matching and ranking algorithms that suit their use case best. In this paper, we explain the LOTUS approach, its implementation and the functionality it provides. We demonstrate the ease with which LOTUS enables text-based resource retrieval at an unprecedented scale in con- crete and domain-specific scenarios. Finally, we provide evidence for the scalability of LOTUS with respect to the LOD Laundromat, the largest collection of easily accessible Linked Open Data currently available.",
keywords = "Findability, Scalable data management, Semantic search, Text indexing",
author = "F. Ilievski and Wouter Beek and {van Erp}, Marieke and Laurens Rietveld and Stefan Schlobach",
year = "2016",
doi = "10.1007/978-3-319-34129-3_29",
isbn = "9783319341286",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer/Verlag",
pages = "470--485",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
}
Downloads: 0
{"_id":"FtYpAWdoWjyjr8k3F","bibbaseid":"ilievski-beek-vanerp-rietveld-schlobach-lotusadaptivetextsearchforbiglinkeddata-2016","downloads":0,"creationDate":"2017-06-06T19:13:39.235Z","title":"LOTUS: Adaptive text search for big linked data","author_short":["Ilievski, F.","Beek, W.","van Erp , M.","Rietveld, L.","Schlobach, S."],"year":2016,"bibtype":"inbook","biburl":"https://raw.githubusercontent.com/KRRVU/website/master/publications/krr.bib","bibdata":{"bibtype":"inbook","type":"inbook","title":"LOTUS: Adaptive text search for big linked data","abstract":"Finding relevant resources on the Semantic Web today is a dirty job: no centralized query service exists and the support for natural language access is limited. We present LOTUS: Linked Open Text Un- leaShed, a text-based entry point to a massive subset of today’s Linked Open Data Cloud. Recognizing the use case dependency of resource re- trieval, LOTUS provides an adaptive framework in which a set of match- ing and ranking algorithms are made available. Researchers and develop- ers are able to tune their own LOTUS index by choosing and combining the matching and ranking algorithms that suit their use case best. In this paper, we explain the LOTUS approach, its implementation and the functionality it provides. We demonstrate the ease with which LOTUS enables text-based resource retrieval at an unprecedented scale in con- crete and domain-specific scenarios. Finally, we provide evidence for the scalability of LOTUS with respect to the LOD Laundromat, the largest collection of easily accessible Linked Open Data currently available.","keywords":"Findability, Scalable data management, Semantic search, Text indexing","author":[{"firstnames":["F."],"propositions":[],"lastnames":["Ilievski"],"suffixes":[]},{"firstnames":["Wouter"],"propositions":[],"lastnames":["Beek"],"suffixes":[]},{"propositions":["van Erp"],"lastnames":[],"firstnames":["Marieke"],"suffixes":[]},{"firstnames":["Laurens"],"propositions":[],"lastnames":["Rietveld"],"suffixes":[]},{"firstnames":["Stefan"],"propositions":[],"lastnames":["Schlobach"],"suffixes":[]}],"year":"2016","doi":"10.1007/978-3-319-34129-3_29","isbn":"9783319341286","series":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","publisher":"Springer/Verlag","pages":"470–485","booktitle":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","bibtex":"@inbook{f61941f98374409c990fb5f25443b77d,\n title = \"LOTUS: Adaptive text search for big linked data\",\n abstract = \"Finding relevant resources on the Semantic Web today is a dirty job: no centralized query service exists and the support for natural language access is limited. We present LOTUS: Linked Open Text Un- leaShed, a text-based entry point to a massive subset of today’s Linked Open Data Cloud. Recognizing the use case dependency of resource re- trieval, LOTUS provides an adaptive framework in which a set of match- ing and ranking algorithms are made available. Researchers and develop- ers are able to tune their own LOTUS index by choosing and combining the matching and ranking algorithms that suit their use case best. In this paper, we explain the LOTUS approach, its implementation and the functionality it provides. We demonstrate the ease with which LOTUS enables text-based resource retrieval at an unprecedented scale in con- crete and domain-specific scenarios. Finally, we provide evidence for the scalability of LOTUS with respect to the LOD Laundromat, the largest collection of easily accessible Linked Open Data currently available.\",\n keywords = \"Findability, Scalable data management, Semantic search, Text indexing\",\n author = \"F. Ilievski and Wouter Beek and {van Erp}, Marieke and Laurens Rietveld and Stefan Schlobach\",\n year = \"2016\",\n doi = \"10.1007/978-3-319-34129-3_29\",\n isbn = \"9783319341286\",\n series = \"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\",\n publisher = \"Springer/Verlag\",\n pages = \"470--485\",\n booktitle = \"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\",\n}\n\n\n","author_short":["Ilievski, F.","Beek, W.","van Erp , M.","Rietveld, L.","Schlobach, S."],"key":"f61941f98374409c990fb5f25443b77d","id":"f61941f98374409c990fb5f25443b77d","bibbaseid":"ilievski-beek-vanerp-rietveld-schlobach-lotusadaptivetextsearchforbiglinkeddata-2016","role":"author","urls":{},"keyword":["Findability","Scalable data management","Semantic search","Text indexing"],"metadata":{"authorlinks":{}},"downloads":0},"search_terms":["lotus","adaptive","text","search","big","linked","data","ilievski","beek","van erp ","rietveld","schlobach"],"keywords":["findability","scalable data management","semantic search","text indexing"],"authorIDs":[],"dataSources":["H6xuGqu5uQ6rXhdJ4","gF7fTLoQtqJwEfGLF","7sSZHoL8DjWLGq889","NZXeb4QPd4MzNiij3","dJmTXpbSWWjnxatYT"]}