It is well-known that query personalization can be an effective technique in dealing with the data scalability challenge, primarily from the human point of view. In order to personalize their query results, user's need to express their preferences in an effective manner. There are two types of preferences: qualitative and quantitative. Each preference type has advantages and disadvantages with respect to expressiveness. The most important disadvantage of the quantitative model is that it cannot support all types of preferences while the qualitative model can only create a partial order over the data, which makes it impossible to rank all the results. The hypothesis of this dissertation is that it is possible to overcome the disadvantages of each preference type by combining both of them, in a single model, using the notion of intensity. This dissertation presents such a hybrid model and a practical system that has the ability to convert the intensity values of qualitative preferences into intensity values of quantitative preferences, without losing the qualitative information. The intensity values allow to create a total order over the tuples in the database that match a user's preferences as well as to significantly increase the coverage of preferences. Hence, the proposed model eliminates the disadvantages of the existing two types of preferences. This dissertation formalizes the hybrid model using a preference graph and proposes an algorithm for efficient preference combination, which is evaluated in an experimental prototype. The experiments show that: (1) intensity plays a crucial role in determining the order of selecting and applying the preferences, and simply ordering the preferences based on the intensity value is not necessarily sufficient; (2) the model can achieve three orders of magnitude increase in coverage compared to other alternatives; (3) the iv solution proposed outperforms other Top-k algorithms by being able to use both qualitative and quantitative preferences at the same time, and (4) the algorithm proposed is efficient in terms of time complexity, returning tuples ordered by the intensity value in a matter of seconds.Keywords Qualitative Preferences, Quantitative Preferences, Top-K Ranking.v The supply and demand of data is becoming commonplace in all aspects of our society; from everyday life (e.g., picking movies or restaurants), to business (e.g., advertising and marketing campaigns), to medicine (e.g., high-throughput sequencing), and science in general (i.e., The Fourth Paradigm [18]). The term "Big Data" [30] has been used to describe the challenges and opportunities from such a ubiquity of data, while also considering its volume, velocity, and variety characteristics. Although some may argue that Big Data is currently entering the Trough of Disillusionment, after following the typical "Hype Cycle" 1 , the reality of the matter remains that there are still many technical challenges, as more and more people are accustomed to using data in their lives (for personal, business, or sci...
This demo presents AstroShelf, our on-going effort to enable astrophysicists to collaboratively investigate celestial objects using data originating from multiple sky surveys, hosted at different sites. The AstroShelf platform combines database and data stream, workflow and visualization technologies to provide a means for querying and displaying telescope images (in a Google Sky manner), visualizations of spectrum data, and for managing annotations. In addition to the user interface, AstroShelf supports a programmatic interface (available as a web service), which allows astrophysicists to incorporate functionality from AstroShelf in their own programs. A key feature is Live Annotations which is the detection and delivery of events or annotations to users in real-time, based on their profiles. We demonstrate the capabilities of AstroShelf through real enduser exploration scenarios (with participation from "stargazers" in the audience), in the presence of simulated annotation workloads executed through web services.
Data drives all aspects of our society, from everyday life, to business, to medicine, and science. It is well known that query personalization can be an effective technique in dealing with the data scalability challenge, primarily from the human point of view. In order to customize their query results, users need to express their preferences in a simple and userfriendly manner. There are two types of preferences: qualitative and quantitative. Each preference type has advantages and disadvantages with respect to expressiveness. In this paper, we present a graph-based theoretical framework and a prototype system that unify qualitative and quantitative preferences, while eliminating their disadvantages. Our integrated system allows for (1) the specification of database preferences and creation of user preference profiles in a user-friendly manner and (2) the manipulation of preferences of individuals or groups of users. A key feature of our hybrid model is the ability to convert qualitative preferences into quantitative preferences using intensity values and without losing the qualitative information. This feature allows us to create a total order over the tuples in the database, matching both qualitative and quantitative preferences, hence significantly increasing the number of tuples covered by the user preferences. We confirmed this experimentally by comparing our preference selection algorithm with Fagin's TA algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.