Code and dataset from paper: " Ontology−Based Query Answering with Group Preferences Thomas Lukasiewicz‚ Maria Vanina Martinez‚ Gerardo I. Simari and Oana Tifrea−Marciuska In ACM Transactions on Internet Technology (TOIT). Vol. 14. No. 4. Pages 15:1−15:24. December, 2014."
If you use the repository in your research please use the above citation.
The dataset folder has 171 combinations of groups ( each in a folder). Each group has its individual folder (e.g. gr1_sc1). For each group we have different users in a separate json file. In the file you can find the partial qualitative preferences expressed in connections. The name of a user identifies uniquely a user in all the groups ( when "1" appears in 2 different groups it refers to the same user "1"). The paper gives you details regarding the dataset collection.
##Abstract The Web has recently been evolving into a system that is in many ways centered on social interactions and is now more and more becoming what is called the Social Semantic Web. One of the many implications of such an evolution is that the ranking of search results no longer depends solely on the structure of the interconnections among Web pages—instead, the social components must also come into play. In this article, we argue that such rankings can be based on ontological background knowledge and on user preferences. Another aspect that has become increasingly important in recent times is that of uncertainty management, since uncertainty can arise due to many uncontrollable factors. To combine these two aspects, we propose extensions of the Datalog+/-- family of ontology languages that both allow for the management of partially ordered preferences of groups of users as well as uncertainty, which is represented via a probabilistic model. We focus on answering k-rank queries in this context, presenting different strategies to compute group preferences as an aggregation of the preferences of a collection of single users. We also study merging operators that are useful for combining the preferences of the users with those induced by the values obtained from the probabilistic model. We then provide algorithms to answer k-rank queries for DAQs (disjunctions of atomic queries) under these group preferences and uncertainty that generalizes top-k queries based on the iterative computation of classical skyline answers. We show that such DAQ answering in Datalog+/-- can be done in polynomial time in the data complexity, under certain reasonable conditions, as long as query answering can also be done in polynomial time (in the data complexity) in the underlying classical ontology. Finally, we present a prototype implementation of the query answering system, as well as experimental results (on the running time of our algorithms and the quality of their results) obtained from real-world ontological data and preference models, derived from information gathered from real users, showing in particular that our approach is feasible in practice.