Continuous Monitoring of Pareto Frontiers on Partially Ordered Attributes for Many Users
Afroza Sultana, Chengkai Li

TL;DR
This paper addresses the challenge of continuously identifying users who prefer new objects based on their partial order preferences, proposing algorithms that leverage shared computation and clustering for efficiency.
Contribution
It introduces novel algorithms for continuous object dissemination considering partial order preferences, including clustering users and approximate solutions for efficiency.
Findings
Algorithms effectively identify target users in real-time.
Shared computation reduces processing time for similar preferences.
Approximate methods balance accuracy and efficiency.
Abstract
We study the problem of continuous object dissemination---given a large number of users and continuously arriving new objects, deliver an object to all users who prefer the object. Many real world applications analyze users' preferences for effective object dissemination. For continuously arriving objects, timely finding users who prefer a new object is challenging. In this paper, we consider an append-only table of objects with multiple attributes and users' preferences on individual attributes are modeled as strict partial orders. An object is preferred by a user if it belongs to the Pareto frontier with respect to the user's partial orders. Users' preferences can be similar. Exploiting shared computation across similar preferences of different users, we design algorithms to find target users of a new object. In order to find users of similar preferences, we study the novel problem of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Human Mobility and Location-Based Analysis · Advanced Clustering Algorithms Research
