2009
DOI: 10.1007/978-3-642-03730-6_36
|View full text |Cite
|
Sign up to set email alerts
|

Recommending Multidimensional Queries

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
50
0
7

Year Published

2011
2011
2018
2018

Publication Types

Select...
7
1
1

Relationship

5
4

Authors

Journals

citations
Cited by 42 publications
(57 citation statements)
references
References 12 publications
0
50
0
7
Order By: Relevance
“…The preferences generated in these works are also explicitly expressed. In the context of the history-based personalisation (Stefanidis et al, 2009), the approaches proposed in Giacometti et al (2009Giacometti et al ( , 2011 aimed at recommending, to the current user, data found in previous sessions similar to the one requested in the current session.…”
Section: Context-aware Recommender Systemsmentioning
confidence: 99%
See 1 more Smart Citation
“…The preferences generated in these works are also explicitly expressed. In the context of the history-based personalisation (Stefanidis et al, 2009), the approaches proposed in Giacometti et al (2009Giacometti et al ( , 2011 aimed at recommending, to the current user, data found in previous sessions similar to the one requested in the current session.…”
Section: Context-aware Recommender Systemsmentioning
confidence: 99%
“…We compared our recommender-based exploration with simple collaborative filtering methods (Herloker et al, 2004), that is named personalised KNN in the following figures and with two of recommender multidimensional systems named respectively Custer H (Giacometti et al, 2008) and EdH (Giacometti et al, 2009). The first one uses K-medoid clustering and collaborative filtering; the second one combines the edit distance with simple Hamming distance for comparing references (multidimensional components) and uses collaborative filtering.…”
Section: A Recommender-based Exploration Of Data Cubesmentioning
confidence: 99%
“…On the other hand, multidimensional databases store huge volumes of data, and as a consequence OLAP queries can return large result sets. Extensional computation of query similarity (i.e., made by comparing query results like in [16] and [17]) can thus pose serious efficiency problems. For this reason we use a metric that computes query similarity at the intensional level, i.e., by only looking at the query expressions.…”
Section: Query Similarity Metricmentioning
confidence: 99%
“…We focus in this paper on multi-dimensional queries (structured queries) and data warehouses (data sources), without restricting the generality of our approach. A simple multi-dimensional query (see [4] for a more detailed definition) is usually represented by a number of dimensions (organized in hierarchies) or their attributes, measures (aggregated KPIs with respect to the top 5 middle-aged customers in my city top -unknown artifact (a) A user's question and derived semantic units (comparable to a parse tree in natural language processing). Successive tokens that satisfy some constraints (e.g.…”
Section: Problem Statementmentioning
confidence: 99%