{"title":"链接数据排名的简短调查","authors":"Semih Yumusak, Erdogan Dogdu, H. Kodaz","doi":"10.1145/2638404.2638523","DOIUrl":null,"url":null,"abstract":"Linked data systems are still far from maturity. Hence, the basic principles are still open for discussion. In our study on building a novel linked data search engine, we have surveyed fundamental methods of internet search technologies in the context of linked data crawling, indexing, ranking, and monitoring. The scope of this ranking survey covers linked data related statistical ranking, database ranking, document level ranking, and Web ranking techniques. In order to classify the linked data ranking methods, we identified a number of categories. These categories are ontology ranking, RDF ranking, graph ranking, entity ranking, document/domain ranking. At the end of the survey, we have listed the ranking techniques based on the well-known PageRank algorithm.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"51 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A short survey of linked data ranking\",\"authors\":\"Semih Yumusak, Erdogan Dogdu, H. Kodaz\",\"doi\":\"10.1145/2638404.2638523\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Linked data systems are still far from maturity. Hence, the basic principles are still open for discussion. In our study on building a novel linked data search engine, we have surveyed fundamental methods of internet search technologies in the context of linked data crawling, indexing, ranking, and monitoring. The scope of this ranking survey covers linked data related statistical ranking, database ranking, document level ranking, and Web ranking techniques. In order to classify the linked data ranking methods, we identified a number of categories. These categories are ontology ranking, RDF ranking, graph ranking, entity ranking, document/domain ranking. At the end of the survey, we have listed the ranking techniques based on the well-known PageRank algorithm.\",\"PeriodicalId\":91384,\"journal\":{\"name\":\"Proceedings of the 2014 ACM Southeast Regional Conference\",\"volume\":\"51 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2014 ACM Southeast Regional Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2638404.2638523\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2014 ACM Southeast Regional Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2638404.2638523","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Linked data systems are still far from maturity. Hence, the basic principles are still open for discussion. In our study on building a novel linked data search engine, we have surveyed fundamental methods of internet search technologies in the context of linked data crawling, indexing, ranking, and monitoring. The scope of this ranking survey covers linked data related statistical ranking, database ranking, document level ranking, and Web ranking techniques. In order to classify the linked data ranking methods, we identified a number of categories. These categories are ontology ranking, RDF ranking, graph ranking, entity ranking, document/domain ranking. At the end of the survey, we have listed the ranking techniques based on the well-known PageRank algorithm.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
