The recent blow up of crowd computing initiatives on the web calls for smarter methodologies and tools to annotate, query and explore repositories. There is the need for scalable techniques able to return also approximate results with respect to a given query as a ranked set of promising alternatives. In this paper we concentrate on annotation and retrieval of software components, exploiting semantic tagging relying on DBpedia. We propose a new hybrid methodology to rank resources in this dataset. Inputs of our ranking system are (i) the DBpedia dataset; (ii) external information sources such as classical search engine results, social tagging systems and wikipedia-related information. We compare our approach with other RDF similarity measures, proving the validity of our algorithm with an extensive evaluation involving real users
Semantic tagging for crowd computing / Mirizzi, R.; Ragone, A.; DI NOIA, Tommaso; Di Sciascio, E.. - (2010), pp. 70-77. (Intervento presentato al convegno 8th Italian Symposium on Advanced Database Systems, SEBD 2010 tenutosi a Rimini nel June 20-23, 2010).
Semantic tagging for crowd computing
Mirizzi, R.;DI NOIA, Tommaso;
2010-01-01
Abstract
The recent blow up of crowd computing initiatives on the web calls for smarter methodologies and tools to annotate, query and explore repositories. There is the need for scalable techniques able to return also approximate results with respect to a given query as a ranked set of promising alternatives. In this paper we concentrate on annotation and retrieval of software components, exploiting semantic tagging relying on DBpedia. We propose a new hybrid methodology to rank resources in this dataset. Inputs of our ranking system are (i) the DBpedia dataset; (ii) external information sources such as classical search engine results, social tagging systems and wikipedia-related information. We compare our approach with other RDF similarity measures, proving the validity of our algorithm with an extensive evaluation involving real usersI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.