Efficient representative subset selection over sliding windows

Representative subset selection (RSS) is an important tool for users to draw insights from massive datasets. Existing literature models RSS as submodular maximization to capture the "diminishing returns" property of representativeness, but often only has a single constraint, which limits i...

Full description

Saved in:
Bibliographic Details
Main Authors: WANG, Yanhao, LI, Yuchen, TAN, Kian-Lee
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2018
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/4092
https://ink.library.smu.edu.sg/context/sis_research/article/5095/viewcontent/08410031.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-5095
record_format dspace
spelling sg-smu-ink.sis_research-50952019-02-07T01:03:29Z Efficient representative subset selection over sliding windows WANG, Yanhao LI, Yuchen TAN, Kian-Lee Representative subset selection (RSS) is an important tool for users to draw insights from massive datasets. Existing literature models RSS as submodular maximization to capture the "diminishing returns" property of representativeness, but often only has a single constraint, which limits its applications to many real-world problems. To capture the recency issue and support various constraints, we formulate dynamic RSS as maximizing submodular functions subject to general d -knapsack constraints (SMDK) over sliding windows. We propose a KnapWindow framework (KW) for SMDK. KW utilizes KnapStream (KS) for SMDK in append-only streams as a subroutine. It maintains a sequence of checkpoints and KS instances over the sliding window. Theoretically, KW is 1−ε1+d -approximate for SMDK. Furthermore, we propose a KnapWindowPlus framework ( KW+ ) to improve upon KW. KW+ builds an index SubKnapChk to manage the checkpoints. By keeping much fewer checkpoints, KW+ achieves higher efficiency than KW while guaranteeing a 1−ε′2+2d -approximate solution for SMDK. Finally, we evaluate KW and KW+ in real-world datasets. The experimental results demonstrate that KW achieves more than two orders of magnitude speedups over the batch baseline and preserves high-quality solutions for SMDK. KW+ further runs 5-10 times faster than KW while providing solutions with equivalent or better utilities. 2018-07-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/4092 info:doi/10.1109/TKDE.2018.2854182 https://ink.library.smu.edu.sg/context/sis_research/article/5095/viewcontent/08410031.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Approximation algorithm Approximation algorithms Data mining Data models data stream Data summarization Heuristic algorithms Indexes Kernel Microsoft Windows Sliding window Submodular maximization Databases and Information Systems Theory and Algorithms
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Approximation algorithm
Approximation algorithms
Data mining
Data models
data stream
Data summarization
Heuristic algorithms
Indexes Kernel
Microsoft Windows
Sliding window
Submodular maximization
Databases and Information Systems
Theory and Algorithms
spellingShingle Approximation algorithm
Approximation algorithms
Data mining
Data models
data stream
Data summarization
Heuristic algorithms
Indexes Kernel
Microsoft Windows
Sliding window
Submodular maximization
Databases and Information Systems
Theory and Algorithms
WANG, Yanhao
LI, Yuchen
TAN, Kian-Lee
Efficient representative subset selection over sliding windows
description Representative subset selection (RSS) is an important tool for users to draw insights from massive datasets. Existing literature models RSS as submodular maximization to capture the "diminishing returns" property of representativeness, but often only has a single constraint, which limits its applications to many real-world problems. To capture the recency issue and support various constraints, we formulate dynamic RSS as maximizing submodular functions subject to general d -knapsack constraints (SMDK) over sliding windows. We propose a KnapWindow framework (KW) for SMDK. KW utilizes KnapStream (KS) for SMDK in append-only streams as a subroutine. It maintains a sequence of checkpoints and KS instances over the sliding window. Theoretically, KW is 1−ε1+d -approximate for SMDK. Furthermore, we propose a KnapWindowPlus framework ( KW+ ) to improve upon KW. KW+ builds an index SubKnapChk to manage the checkpoints. By keeping much fewer checkpoints, KW+ achieves higher efficiency than KW while guaranteeing a 1−ε′2+2d -approximate solution for SMDK. Finally, we evaluate KW and KW+ in real-world datasets. The experimental results demonstrate that KW achieves more than two orders of magnitude speedups over the batch baseline and preserves high-quality solutions for SMDK. KW+ further runs 5-10 times faster than KW while providing solutions with equivalent or better utilities.
format text
author WANG, Yanhao
LI, Yuchen
TAN, Kian-Lee
author_facet WANG, Yanhao
LI, Yuchen
TAN, Kian-Lee
author_sort WANG, Yanhao
title Efficient representative subset selection over sliding windows
title_short Efficient representative subset selection over sliding windows
title_full Efficient representative subset selection over sliding windows
title_fullStr Efficient representative subset selection over sliding windows
title_full_unstemmed Efficient representative subset selection over sliding windows
title_sort efficient representative subset selection over sliding windows
publisher Institutional Knowledge at Singapore Management University
publishDate 2018
url https://ink.library.smu.edu.sg/sis_research/4092
https://ink.library.smu.edu.sg/context/sis_research/article/5095/viewcontent/08410031.pdf
_version_ 1770574305486176256