Filters








3,084 Hits in 2.7 sec

Fully Dynamic Algorithm for Constrained Submodular Optimization [article]

Silvio Lattanzi, Slobodan Mitrović, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam
2020 arXiv   pre-print
task of maximizing a monotone submodular function under a cardinality constraint is at the core of many machine learning and data mining applications, including data summarization, sparse regression and coverage  ...  Streaming robust submodular maximization: A partitioned thresh- olding approach.  ...  the values of f for blocks of queries (insertions and deletions) for a fixed k (as the plots in Fig. 9 ).  ... 
arXiv:2006.04704v1 fatcat:enk7gqxxafg57jguhapc2svnxu

Towards an extensible efficient event processing kernel

Mohammad Sadoghi
2012 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium - PhD '12  
The efficient processing of large collections of patterns (Boolean expressions, XPath expressions, or continuous SQL queries) over data streams plays a central role in major data intensive applications  ...  data analysis, including computational finance and intrusion detection, demand meeting stringent subsecond processing requirements and providing high-frequency and low-latency event processing over data streams  ...  queries are continuously evaluated over the event stream.  ... 
doi:10.1145/2213598.2213602 dblp:conf/sigmod/Sadoghi12 fatcat:dqbmivxweva77nth3vkepgs2iy

Location-aware Influence Maximization over Dynamic Social Streams

Yanhao Wang, Yuchen Li, Ju Fan, Kian-Lee Tan
2018 ACM Transactions on Information Systems  
In this article, we first define two IM queries, namely Stream Influence Maximization (SIM) and Location-aware SIM (LSIM), to track influential users over social streams.  ...  LSIM further considers social actions are associated with geo-tags and identifies a seed set that maximizes the influence value in a query region over a location-aware social stream.  ...  We prove Theorem 3.7 by reducing a well-known NP-hard problem, i.e., Maximum k-Coverage, to SIM.  ... 
doi:10.1145/3230871 fatcat:iwncw6pzq5dufilah5enpayau4

Region-Based Message Exploration over Spatio-Temporal Data Streams

Lisi Chen, Shuo Shang
2019 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We develop a region-based message exploration mechanism that retrieve spatio-temporal message clusters from a stream of spatio-temporal messages based on users' preferences on message topic and message  ...  Related Work Continuous query processing over spatio-temporal data streams Our problem is relevant to the location-based publish/subscribe problem.  ...  Due to the high arrival rate of spatio-temporal data streams and their vast topic coverage, it is of great interest for users to discover and monitor trending events and topics based on their preferred  ... 
doi:10.1609/aaai.v33i01.3301873 fatcat:u2kpkkhuwjccvmhnexassiymgy

Efficient instance-based learning on data streams

Jürgen Beringer, Eyke Hüllermeier
2007 Intelligent Data Analysis  
At the same time, the algorithm is relatively robust and thus applicable to streams with different characteristics.  ...  The processing of data streams in general and the mining of such streams in particular have recently attracted considerable attention in various research fields.  ...  Classification of Queries In order to classify a new query instance x 0 , we employ a simple majority voting procedure among the k nearest neighbors.  ... 
doi:10.3233/ida-2007-11604 fatcat:oqflqhcqczebrogebdfevsxnpe

THE OPALS DATA MANAGER – EFFICIENT DATA MANAGEMENT FOR PROCESSING LARGE AIRBORNE LASER SCANNING PROJECTS

J. Otepka, G. Mandlburger, W. Karel
2012 ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
If a stream is deleted, all corresponding chunks are added to a simple garbage collection.  ...  Additionally, the k-d tree rapidly gets unbalanced in case of update operations (insert or delete points).  ... 
doi:10.5194/isprsannals-i-3-153-2012 fatcat:x2yceohxp5cnhopixskqoruwua

A Survey of Approximate Quantile Computation on Large-scale Data

Zhiwei Chen, Aoqian Zhang
2020 IEEE Access  
Finally, we conclude with coverage of existing packages in different languages and with a brief discussion of the future direction in this area.  ...  Both deterministic algorithms and randomized algorithms that compute approximate quantiles over streaming models or distributed models are covered.  ...  If n + 1 = 2 k + 1, create F 2 k (2 k+1 , 2 ) from VOLUME 4, 2016 F 2 k (2 k , 2 ) and insert the new element into it, thus getting F 2 k +1 (2 k+1 , 2 ). • DELETE Compute F n−1 (2 k , 2 ) from F n (2  ... 
doi:10.1109/access.2020.2974919 fatcat:rdi5xlombjfylpqazpribwfqri

Real-time influence maximization on dynamic social streams

Yanhao Wang, Qi Fan, Yuchen Li, Kian-Lee Tan
2017 Proceedings of the VLDB Endowment  
To address this problem, we define a novel IM query named Stream Influence Maximization (SIM) on social streams.  ...  Next, we propose the Influential Checkpoints (IC) framework to facilitate continuous SIM query processing.  ...  [3] developed two approaches for a special case of SSO (i.e., the online Maximum k-Coverage problem) with the same 1/4 approximation ratio.  ... 
doi:10.14778/3067421.3067429 fatcat:yaiwmvdt6fdn5m5tj4zb6mvzfa

Mean Field Models of Message Throughput in Dynamic Peer-to-Peer Systems [article]

Aaron Harwood, Olga Ohrimenko
2007 arXiv   pre-print
Our models cover the unit and more general k buffer cases, i.e. where a peer can buffer at most k messages at any one time, and we give results for both single and multi-source message streams.  ...  We define coverage rate as peer-messages per unit time, i.e. the rate at which a number of peers receive messages, and show that the coverage rate is limited by the churn rate and buffer size.  ...  Typically each peer that receives the query will delete it after consideration.  ... 
arXiv:0705.2065v1 fatcat:y55ef6mkkrdbxa6bgycrywnar4

Continuous Top-k Monitoring on Document Streams

Leong Hou U, Junjie Zhang, Kyriakos Mouratidis, Ye Li
2017 IEEE Transactions on Knowledge and Data Engineering  
Our objective is to support large numbers of users and high stream rates, while refreshing the top-k results almost instantaneously.  ...  A central server monitors the document stream and continuously reports to each user the top-k documents that are most relevant to her keywords.  ...  The proposed solution utilizes this "coverage" relationship between queries to safely ignore some of them when a document streams in.  ... 
doi:10.1109/tkde.2017.2657622 fatcat:77omwloaijejfmkhqhigfmerfu

Decentralized resource management for a distributed continuous media server

C. Shahabi, F. Banaei-Kashani
2002 IEEE Transactions on Parallel and Distributed Systems  
Our proposed resource management system is based on a fully decentralized approach to achieve optimal scalability and robustness.  ...  To achieve a high resource utilization, the object delivery scheme uses our proposed cost function, as well as various object location and resource reservation policies to select and allocate the best streaming  ...  Propagation of the query packet is performed by selective flooding based on a propagation policy that determines the coverage of the propagation (see Section 4.2 for various propagation policies).  ... 
doi:10.1109/tpds.2002.1058101 fatcat:lrgtjf5olrfsbh6xqk4qprbdrq

Decentralized resource management for a distributed continuous media server

C. Shahabi, F. Banaei-Kashani
2002 IEEE Transactions on Parallel and Distributed Systems  
Our proposed resource management system is based on a fully decentralized approach to achieve optimal scalability and robustness.  ...  To achieve a high resource utilization, the object delivery scheme uses our proposed cost function, as well as various object location and resource reservation policies to select and allocate the best streaming  ...  Propagation of the query packet is performed by selective flooding based on a propagation policy that determines the coverage of the propagation (see Section 4.2 for various propagation policies).  ... 
doi:10.1109/tpds.2002.1019860 fatcat:zqompq57vjff5na5p4pjjqt3nm

NanoSpring: reference-free lossless compression of nanopore sequencing reads using an approximate assembly approach [article]

Qingxi Meng, Shubham Chandak, Yifan Zhu, Tsachy Weissman
2021 bioRxiv   pre-print
Contribution of streams to compressed size Coverage To understand the impact of sequencing coverage on the performance of NanoSpring, we tested it on two datasets subsampled to multiple coverage values  ...  Since we can expect overlapping sequences, potentially with substitution/insertion/deletion errors, to have common k-mers (for sufficiently small k), MinHash provides us a way to efficiently estimate the  ... 
doi:10.1101/2021.06.09.447198 fatcat:cev6iepz3bbsve3k5b3pqa7cc4

Automatic classification of Web queries using very large unlabeled query logs

Steven M. Beitzel, Eric C. Jensen, David D. Lewis, Abdur Chowdhury, Ophir Frieder
2007 ACM Transactions on Information Systems  
This suggests it is possible to topically classify a significant portion of the query stream without requiring external sources of information, allowing for deployment in operationally restricted environments  ...  Successful query classification poses a challenging problem, as Web queries are short, thus providing few features.  ...  alone while remaining robust to changes in the query stream over time.  ... 
doi:10.1145/1229179.1229183 fatcat:atp5ern5tjdotebis4fgegpvw4

The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness [article]

Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2020 arXiv   pre-print
coverage functions.  ...  Our model captures the streaming setting (by considering a large number of players), and, in addition, two player approximation results for it translate into the robust setting.  ...  As we show below, our results yield both new hardness and algorithmic results in the context of data streams and robustness. Data stream algorithms.  ... 
arXiv:2003.13459v1 fatcat:dea4oconzraajf764fwnvolrl4
« Previous Showing results 1 — 15 out of 3,084 results