{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T22:11:13Z","timestamp":1760220673403,"version":"build-2065373602"},"reference-count":17,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T00:00:00Z","timestamp":1347926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Monitoring data streams in a distributed system has attracted considerable interest in recent years. The task of feature selection (e.g., by monitoring the information gain of various features) requires a very high communication overhead when addressed using straightforward centralized algorithms. While most of the existing algorithms deal with monitoring simple aggregated values such as frequency of occurrence of stream items, motivated by recent contributions based on geometric ideas we present an alternative approach. The proposed approach enables monitoring values of an arbitrary threshold function over distributed data streams through stream dependent constraints applied separately on each stream. We report numerical experiments on a real-world data that detect instances where communication between nodes is required, and compare the approach and the results to those recently reported in the literature.<\/jats:p>","DOI":"10.3390\/a5030379","type":"journal-article","created":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T11:13:20Z","timestamp":1347966800000},"page":"379-397","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Monitoring Threshold Functions over Distributed Data Streams with Node Dependent Constraints"],"prefix":"10.3390","volume":"5","author":[{"given":"Yaakov","family":"Malinovsky","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, University of Maryland, Baltimore County, Baltimore, MD 21250, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"Kogan","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, University of Maryland, Baltimore County, Baltimore, MD 21250, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2012,9,18]]},"reference":[{"unstructured":"Madden, S., and Franklin, M.J. (March, January 26). An Architecture for Queries Over Streaming Sensor Data. Proceedings of the ICDE 02, San Jose, CA.","key":"ref_1"},{"unstructured":"Dilman, M., and Raz, D. (,  2001). Efficient Reactive Monitoring. Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communication Societies, Anchorage, Alaska.","key":"ref_2"},{"doi-asserted-by":"crossref","unstructured":"Zhu, Y., and Shasha, D. (,  2002). Statestream: Statistical Monitoring of Thousands of Data Streamsin Real Time. Proceeding of the 28th international conference on Very Large Data Bases (VLDB), Hong Kong, China.","key":"ref_3","DOI":"10.1016\/B978-155860869-6\/50039-1"},{"doi-asserted-by":"crossref","unstructured":"Yi, B.-K., Sidiropoulos, N., Johnson, T., Jagadish, H.V., Faloutsos, C., and Biliris, A. (,  2000). Online Datamining for Co\u2013Evolving Time Sequences. Proceedings of ICDE 00IEEE Computer Society, San Diego, CA.","key":"ref_4","DOI":"10.21236\/ADA371154"},{"unstructured":"Manjhi, A., Shkapenyuk, V., Dhamdhere, K., and Olston, C. (,  2005). Finding (Recently) Frequent Items in Distributed Data Streams. Proceedings of the 21st International Conference on Data Engineering (ICDE 05), Tokyo, Japan.","key":"ref_5"},{"doi-asserted-by":"crossref","unstructured":"Wolff, R., Bhaduri, K., and Kargupta, H. (,  2006). Local L2-Thresholding Based Data Mining in Peer-to-Peer Systems. Proceedings of the SIAM International Conference on Data Mining (SDM 06), Bethesda, MD, USA.","key":"ref_6","DOI":"10.1137\/1.9781611972764.38"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1109\/TKDE.2008.169","article-title":"A generic local algorithm with applications for data mining in large distributed systems","volume":"21","author":"Wolff","year":"2009","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/1292609.1292613","article-title":"A geometric approach to monitoring threshold functions over distributed data streams","volume":"23","author":"Sharfman","year":"2007","journal-title":"ACM Trans. Database Syst."},{"doi-asserted-by":"crossref","unstructured":"May, M., and Saitta, L. (2010). Ubiquitous Knowledge Discovery, Springer\u2013Verlag.","key":"ref_9","DOI":"10.1007\/978-3-642-16392-0"},{"doi-asserted-by":"crossref","unstructured":"Kogan, J. (,  2012). Feature Selection over Distributed Data Streams through Convex Optimization. Proceedings of the Twelfth SIAM International Conference on Data Mining (SDM 2012), Anaheim, CA, USA.","key":"ref_10","DOI":"10.1137\/1.9781611972825.41"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1109\/TKDE.2011.102","article-title":"Shape sensitive geometric monitoring","volume":"24","author":"Keren","year":"2012","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Gray, R.M. (1990). Entropy and Information Theory, Springer\u2013Verlag.","key":"ref_12","DOI":"10.1007\/978-1-4757-3982-4"},{"unstructured":"Hinrichsen, D., and Pritchard, A.J. (1990). Controlof Uncertain Systems, Birkhauser.","key":"ref_13"},{"unstructured":"Rudin, W. (1976). Principles of Mathematical Analysis, McGraw-Hill.","key":"ref_14"},{"doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T. (1970). Convex Analysis, Princeton University Press.","key":"ref_15","DOI":"10.1515\/9781400873173"},{"unstructured":"Bottou, L. Home Page. Available online:leon.bottou.org\/projects\/sgd.","key":"ref_16"},{"doi-asserted-by":"crossref","unstructured":"Mirkin, B. (2005). Clustering for Data Mining: A Data Recovery Approach, Chapman & Hall\/CRC.","key":"ref_17","DOI":"10.1201\/9781420034912"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/5\/3\/379\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:52:24Z","timestamp":1760219544000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/5\/3\/379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,18]]},"references-count":17,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2012,9]]}},"alternative-id":["a5030379"],"URL":"https:\/\/doi.org\/10.3390\/a5030379","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2012,9,18]]}}}