Efficient Approximation Framework for Attribute Recommendation

Author:

Chen Xingguang1ORCID,Zhang Fangyuan1ORCID,Huang Jinchao1ORCID,Wang Sibo1ORCID

Affiliation:

1. The Chinese University of Hong Kong, Hong Kong, China

Abstract

Trend analysis is a fundamental type of analytical query in online analytical processing (OLAP) systems. In trend analysis, a key step is to identify k valuable attributes whose distributions in two subsets under different predicates significantly differ for further investigation, where the difference is measured by metric functions. However, the exact solution that involves scanning all records is prohibitively expensive, particularly when handling large datasets in the era of big data. To minimize unnecessary data access, the existing state-of-the-art solution TopKAttr adopts sampling to avoid the expensive data scan. However, their solution still has two main drawbacks. Firstly, their solution is tailored only for two limited metric functions: the Earth Mover distance and Euclidean distance, and cannot be generalized to more complicated metric functions. Besides, their solution still aims to return the exact top-k answers via the sampling method, which still causes high running costs as shown in our experiment. Motivated by these limitations, we propose a general approximation framework for attribute recommendation that efficiently returns the top-k attributes with theoretical guarantees while supporting an extensive range of metric functions, such as the Kolmogorov-Smirnov test (KS-test), Chebyshev distance, the Earth Mover distance, Euclidean distance, and with the potential to more metrics. The key to our framework is a new bound estimation strategy that can be applied to a wide spectrum of metrics, as we listed above. Based on our estimation framework, we further devise an efficient approximation algorithm with theoretical guarantees to answer the top-k queries, which is widely used in attribute recommendation. Extensive experiments on four real large datasets show that our framework gains up to an order of magnitude speed-up and consistently high accuracy compared to TopKAttr, providing a promising alternative for attribute recommendation in OLAP systems.

Publisher

Association for Computing Machinery (ACM)

Reference57 articles.

1. James Abello , Panos M Pardalos , and Mauricio GC Resende . 2013. Handbook of massive data sets . Vol. 4 . James Abello, Panos M Pardalos, and Mauricio GC Resende. 2013. Handbook of massive data sets. Vol. 4.

2. 005)]% AgrawalCKMNS05, Sanjay Agrawal , Surajit Chaudhuri , Lubor Kollá r , Arunprasad P. Marathe, Vivek R. Narasayya, and Manoj Syamala. 2005 . Database tuning advisor for microsoft SQL server 2005: demo. In SIGMOD. 930--932. 005)]% AgrawalCKMNS05, Sanjay Agrawal, Surajit Chaudhuri, Lubor Kollá r, Arunprasad P. Marathe, Vivek R. Narasayya, and Manoj Syamala. 2005. Database tuning advisor for microsoft SQL server 2005: demo. In SIGMOD. 930--932.

3. Nikolaus Augsten , Denilson Barbosa , Michael H. Bö hlen, and Themis Palpanas . 2010 . TASM : Top-k Approximate Subtree Matching. In ICDE. 353--364. Nikolaus Augsten, Denilson Barbosa, Michael H. Bö hlen, and Themis Palpanas. 2010. TASM: Top-k Approximate Subtree Matching. In ICDE. 353--364.

4. Concentration inequalities for sampling without replacement

5. Peter A. Boncz Torsten Grust Maurice van Keulen Stefan Manegold Jan Rittinger and Jens Teubner. 2006. MonetDB/XQuery: a fast XQuery processor powered by a relational engine. In SIGMOD. 479--490. Peter A. Boncz Torsten Grust Maurice van Keulen Stefan Manegold Jan Rittinger and Jens Teubner. 2006. MonetDB/XQuery: a fast XQuery processor powered by a relational engine. In SIGMOD. 479--490.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3