{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T17:09:34Z","timestamp":1786813774925,"version":"build-2736575974"},"reference-count":37,"publisher":"SAGE Publications","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2022,4,18]]},"abstract":"<jats:p>Compact data models have become relevant due to the massive, ever-increasing generation of data. We propose Observers-based Data Modeling (ODM), a lightweight algorithm to extract low density data models (aka coresets) that are suitable for both static and stream data analysis. ODM coresets keep data internal structures while alleviating computational costs of machine learning during evaluation phases accounting for a O(n log n) worst-case complexity. We compare ODM with previous proposals in classification, clustering, and outlier detection. Results show the preponderance of ODM for obtaining the best trade-off in accuracy, versatility, and speed.<\/jats:p>","DOI":"10.3233\/ida-215741","type":"journal-article","created":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T13:25:46Z","timestamp":1650979546000},"page":"785-803","source":"Crossref","is-referenced-by-count":1,"title":["Modeling data with observers"],"prefix":"10.1177","volume":"26","author":[{"given":"Fares","family":"Meghdouri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F\u00e9lix","family":"Iglesias V\u00e1zquez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tanja","family":"Zseby","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-215741_ref1","doi-asserted-by":"crossref","unstructured":"N. Abe, B. Zadrozny and J. Langford, Outlier detection by active learning, in: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2006, pp. 504\u2013509.","DOI":"10.1145\/1150402.1150459"},{"key":"10.3233\/IDA-215741_ref2","first-page":"1","article-title":"Geometric approximation via coresets","volume":"52","author":"Agarwal","year":"2005","journal-title":"Combinatorial and Computational Geometry"},{"key":"10.3233\/IDA-215741_ref3","doi-asserted-by":"crossref","unstructured":"C. Aggarwal, A. Hinneburg and D.A. Keim, On the surprising behavior of distance metrics in high dimensional space, in: International Conference on Database Theory, Springer, 2001, pp. 420\u2013434.","DOI":"10.1007\/3-540-44503-X_27"},{"key":"10.3233\/IDA-215741_ref4","doi-asserted-by":"crossref","unstructured":"F. Angiulli, Fast condensed nearest neighbor rule, in: Proceedings of the 22nd International Conference on Machine Learning, 2005, pp. 25\u201332.","DOI":"10.1145\/1102351.1102355"},{"key":"10.3233\/IDA-215741_ref6","unstructured":"H. Attias, A variational baysian framework for graphical models, in: Advances in Neural Information Processing Systems, 2000, pp. 209\u2013215."},{"key":"10.3233\/IDA-215741_ref7","doi-asserted-by":"crossref","unstructured":"O. Bachem, M. Lucic and A. Krause, Scalable k-means clustering via lightweight coresets, in: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018, pp. 1119\u20131127.","DOI":"10.1145\/3219819.3219973"},{"issue":"9","key":"10.3233\/IDA-215741_ref8","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Communications of the ACM"},{"issue":"3","key":"10.3233\/IDA-215741_ref9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0168-1699(99)00046-0","article-title":"Comparative accuracies of artificial neural networks and discriminant analysis in predicting forest cover types from cartographic variables","volume":"24","author":"Blackard","year":"1999","journal-title":"Computers and Electronics in Agriculture"},{"issue":"1","key":"10.3233\/IDA-215741_ref12","first-page":"551","article-title":"Automated scalable bayesian inference via hilbert coresets","volume":"20","author":"Campbell","year":"2019","journal-title":"The Journal of Machine Learning Research"},{"issue":"4","key":"10.3233\/IDA-215741_ref13","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1007\/s10618-015-0444-8","article-title":"On the evaluation of unsupervised outlier detection: Measures, datasets, and an empirical study","volume":"30","author":"Campos","year":"2016","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10.3233\/IDA-215741_ref14","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.enbuild.2015.11.071","article-title":"Accurate occupancy detection of an office room from light, temperature, humidity and co2 measurements using statistical learning models","volume":"112","author":"Candanedo","year":"2016","journal-title":"Energy and Buildings"},{"key":"10.3233\/IDA-215741_ref15","unstructured":"P. Ciaccia, M. Patella and P. Zezula, M-tree: An e cient access method for similarity search in metric spaces, in: Proceedings of the 23rd VLDB Conference, Athens, Greece, Citeseer, 1997, pp. 426\u2013435."},{"issue":"4","key":"10.3233\/IDA-215741_ref16","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.dss.2009.05.016","article-title":"Modeling wine preferences by data mining from physicochemical properties","volume":"47","author":"Cortez","year":"2009","journal-title":"Decision Support Systems"},{"key":"10.3233\/IDA-215741_ref18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.engappai.2018.03.023","article-title":"Reliable writer identification in medieval manuscripts through page layout features: The \u201cavila\u201d bible case","volume":"72","author":"De Stefano","year":"2018","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.3233\/IDA-215741_ref19","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"Dem\u0161ar","year":"2006","journal-title":"The Journal of Machine Learning Research"},{"issue":"3","key":"10.3233\/IDA-215741_ref21","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/18M1209854","article-title":"Turning big data into tiny data: Constant-size coresets for k-means, pca, and projective clustering","volume":"49","author":"Feldman","year":"2020","journal-title":"SIAM Journal on Computing"},{"key":"10.3233\/IDA-215741_ref22","doi-asserted-by":"crossref","unstructured":"P. Fr\u00e4nti, R. Mariescu-Istodor and C. Zhong, Xnn graph, in: Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR), Springer, 2016, pp. 207\u2013217.","DOI":"10.1007\/978-3-319-49055-7_19"},{"issue":"9","key":"10.3233\/IDA-215741_ref23","doi-asserted-by":"crossref","first-page":"3034","DOI":"10.1016\/j.patcog.2014.03.017","article-title":"Centroid index: Cluster level similarity measure","volume":"47","author":"Fr\u00e4nti","year":"2014","journal-title":"Pattern Recognition"},{"key":"10.3233\/IDA-215741_ref24","unstructured":"B. Fritzke, A growing neural gas network learns topologies, in: Advances in Neural Information Processing Systems, 1995, pp. 625\u2013632."},{"issue":"1","key":"10.3233\/IDA-215741_ref25","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/B:VISI.0000042993.50813.60","article-title":"The amsterdam library of object images","volume":"61","author":"Geusebroek","year":"2005","journal-title":"International Journal of Computer Vision"},{"issue":"3","key":"10.3233\/IDA-215741_ref26","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","article-title":"The condensed nearest neighbor rule (corresp.)","volume":"14","author":"Hart","year":"1968","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"10.3233\/IDA-215741_ref27","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","article-title":"Comparing partitions","volume":"2","author":"Hubert","year":"1985","journal-title":"Journal of Classification"},{"key":"10.3233\/IDA-215741_ref28","unstructured":"J. Huggins, T. Campbell and T. Broderick, Coresets for scalable bayesian logistic regression, in: Advances in Neural Information Processing Systems, 2016, pp. 4080\u20134088."},{"issue":"4","key":"10.3233\/IDA-215741_ref30","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1007\/s10618-019-00619-1","article-title":"Deep learning for time series classification: A review","volume":"33","author":"Ismail Fawaz","year":"2019","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"20","key":"10.3233\/IDA-215741_ref31","doi-asserted-by":"crossref","first-page":"6969","DOI":"10.1080\/01431161.2013.810825","article-title":"A hybrid pansharpening approach and multiscale object-based image analysis for mapping diseased pine and oak trees","volume":"34","author":"Johnson","year":"2013","journal-title":"International Journal of Remote Sensing"},{"issue":"2","key":"10.3233\/IDA-215741_ref33","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1111\/j.1365-2966.2010.17325.x","article-title":"The high time resolution universe pulsar survey \u2013 i. system configuration and initial discoveries","volume":"409","author":"Keith","year":"2010","journal-title":"Monthly Notices of the Royal Astronomical Society"},{"key":"10.3233\/IDA-215741_ref34","doi-asserted-by":"crossref","unstructured":"F. Keller, E. Muller and K. Bohm, Hics: High contrast subspaces for density-based outlier ranking, in: 2012 IEEE 28th International Conference on Data Engineering, IEEE, 2012, pp. 1037\u20131048.","DOI":"10.1109\/ICDE.2012.88"},{"issue":"9","key":"10.3233\/IDA-215741_ref35","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1109\/5.58325","article-title":"The self-organizing map","volume":"78","author":"Kohonen","year":"1990","journal-title":"Proceedings of the IEEE"},{"key":"10.3233\/IDA-215741_ref38","unstructured":"B. Mirzasoleiman, J. Bilmes and J. Leskovec, Coresets for data-efficient training of machine learning models, in: International Conference on Machine Learning, PMLR, 2020, pp. 6950\u20136960."},{"key":"10.3233\/IDA-215741_ref39","doi-asserted-by":"crossref","unstructured":"S. Ramaswamy, R. Rastogi and K. Shim, Efficient algorithms for mining outliers from large data sets, in: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000, pp. 427\u2013438.","DOI":"10.1145\/335191.335437"},{"issue":"8","key":"10.3233\/IDA-215741_ref40","doi-asserted-by":"crossref","first-page":"2173","DOI":"10.1109\/TKDE.2016.2551240","article-title":"Set matching measures for external cluster validity","volume":"28","author":"Rezaei","year":"2016","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-215741_ref41","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","article-title":"Silhouettes: A graphical aid to the interpretation and validation of cluster analysis","volume":"20","author":"Rousseeuw","year":"1987","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"10.3233\/IDA-215741_ref42","unstructured":"A. Ultsch, Clustering with som: U^* c, in: Proceedings of the Workshop on Self-organizing Maps, 2005, 2005."},{"key":"10.3233\/IDA-215741_ref43","doi-asserted-by":"crossref","unstructured":"F.I. V\u00e1zquez, T. Zseby and A. Zimek, Outlier detection based on low density models, in: 2018 IEEE International Conference on Data Mining Workshops (ICDMW), 2018, pp. 970\u2013979.","DOI":"10.1109\/ICDMW.2018.00140"},{"key":"10.3233\/IDA-215741_ref44","doi-asserted-by":"crossref","unstructured":"F. Wilcoxon, Individual comparisons by ranking methods, in: Breakthroughs in Statistics, Springer, 1992, pp. 196\u2013202.","DOI":"10.1007\/978-1-4612-4380-9_16"},{"issue":"3","key":"10.3233\/IDA-215741_ref45","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1023\/B:DAMI.0000023676.72185.7c","article-title":"On-line unsupervised outlier detection using finite mixtures with discounting learning algorithms","volume":"8","author":"Yamanishi","year":"2004","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10.3233\/IDA-215741_ref46","doi-asserted-by":"crossref","unstructured":"A. Zimek, M. Gaudet, R.J. Campello and J. Sander, Subsampling for efficient and effective unsupervised outlier detection ensembles, in: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013, pp. 428\u2013436.","DOI":"10.1145\/2487575.2487676"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-215741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:19:27Z","timestamp":1777454367000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-215741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,18]]},"references-count":37,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.3233\/ida-215741","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,18]]}}}