Efficient Top-k Searching According to User Preferences Based on Fuzzy Functions with Usage of Tree-Oriented Data Structures

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10099592" target="_blank" >RIV/00216208:11320/11:10099592 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Efficient Top-k Searching According to User Preferences Based on Fuzzy Functions with Usage of Tree-Oriented Data Structures

Popis výsledku v původním jazyce

In the last few years, research of top-k processing is in progress in various domains. The aim of our research is efficient top-k searching of the best k objects with more attributes according to more complex user preferences. We focus on a multi-user solution, where data is common for all users. We use a model of user preferences based on fuzzy functions, where each user can express his/her preferences for each attribute by a fuzzy function and mutual relations between the attributes by an aggregationfunction. In our research we focus on top-k searching in tree-oriented data structures and we developed various top-k algorithms, which support the model of user preferences and solve top-k problem efficiently, i.e. without searching all of objects stored in the tree-oriented data structure. In future research, we want to study various models of user preferences and the usage of relevance feedback in repeated user queries.

Název v anglickém jazyce

Efficient Top-k Searching According to User Preferences Based on Fuzzy Functions with Usage of Tree-Oriented Data Structures

Popis výsledku anglicky

In the last few years, research of top-k processing is in progress in various domains. The aim of our research is efficient top-k searching of the best k objects with more attributes according to more complex user preferences. We focus on a multi-user solution, where data is common for all users. We use a model of user preferences based on fuzzy functions, where each user can express his/her preferences for each attribute by a fuzzy function and mutual relations between the attributes by an aggregationfunction. In our research we focus on top-k searching in tree-oriented data structures and we developed various top-k algorithms, which support the model of user preferences and solve top-k problem efficiently, i.e. without searching all of objects stored in the tree-oriented data structure. In future research, we want to study various models of user preferences and the usage of relevance feedback in repeated user queries.

Druh

O - Ostatní výsledky

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů