The Library
Query-driven learning for predictive analytics of data subspace cardinality
Tools
Tools
Tools
Anagnostopoulos, C. and Triantafillou, Peter (2017) Query-driven learning for predictive analytics of data subspace cardinality. ACM Transactions on Knowledge Discovery from Data (TKDD), 11 (4). 47. doi:10.1145/3059177 ISSN 1556-4681.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://doi.org/10.1145/3059177
Abstract
Fundamental to many predictive analytics tasks is the ability to estimate the cardinality (number of data items) of multi-dimensional data subspaces, defined by query selections over datasets. This is crucial for data analysts dealing with, e.g., interactive data subspace explorations, data subspace visualizations, and in query processing optimization. However, in many modern data systems, predictive analytics may be (i) too costly money-wise, e.g., in clouds, (ii) unreliable, e.g., in modern Big Data query engines, where accurate statistics are difficult to obtain/maintain, or (iii) infeasible, e.g., for privacy issues. We contribute a novel, query-driven, function estimation model of analyst-defined data subspace cardinality. The proposed estimation model is highly accurate in terms of prediction and accommodating the well-known selection queries: multi-dimensional range and distance-nearest neighbors (radius) queries. Our function estimation model: (i) quantizes the vectorial query space, by learning the analysts' access patterns over a data space, (ii) associates query vectors with their corresponding cardinalities of the analyst-defined data subspaces, (iii) abstracts and employs query vectorial similarity to predict the cardinality of an unseen/unexplored data subspace, and (iv) identifies and adapts to possible changes of the query subspaces based on the theory of optimal stopping. The proposed model is decentralized, facilitating the scaling-out of such predictive analytics queries. The research significance of the model lies in that (i) it is an attractive solution when data-driven statistical techniques are undesirable or infeasible, (ii) it offers a scale-out, decentralized training solution, (iii) it is applicable to different selection query types, and (iv) it offers a performance that is superior to that of data-driven approaches.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
| Journal or Publication Title: | ACM Transactions on Knowledge Discovery from Data (TKDD) | ||||
| Publisher: | ACM | ||||
| ISSN: | 1556-4681 | ||||
| Official Date: | August 2017 | ||||
| Dates: |
|
||||
| Volume: | 11 | ||||
| Number: | 4 | ||||
| Article Number: | 47 | ||||
| DOI: | 10.1145/3059177 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Reuse Statement (publisher, data, author rights): | cited By 0 | ||||
| Access rights to Published version: | Restricted or Subscription Access | ||||
| Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
