{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:20:29Z","timestamp":1754162429128,"version":"3.41.2"},"reference-count":35,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T00:00:00Z","timestamp":1753833600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Appl. Math. Stat."],"abstract":"<jats:p>Sparse tensor operations are increasingly important in diverse applications such as social networks, deep learning, diagnosis, crime, and review analysis. However, a major obstacle in sparse tensor research is the lack of large-scale sparse tensor datasets. Another challenge lies in analyzing sparse tensor features, which are essential not only for understanding the nonzero pattern but also for selecting the most suitable storage format, decomposition algorithm, and reordering methods. However, due to the large size of real-world tensors, even extracting these features can be computationally expensive without careful optimization. To address these limitations, we have developed a smart sparse tensor generator that replicates key characteristics of real sparse tensors. Additionally, we propose efficient methods for extracting a comprehensive set of sparse tensor features. The effectiveness of our generator is validated through the quality of extracted features and the performance of decomposition on the generated tensors. Both the sparse tensor feature extractor and the tensor generator are open source with all the artifacts available at <jats:ext-link>https:\/\/github.com\/sparcityeu\/FeaTensor<\/jats:ext-link> and <jats:ext-link>https:\/\/github.com\/sparcityeu\/GenTensor<\/jats:ext-link>, respectively.<\/jats:p>","DOI":"10.3389\/fams.2025.1589033","type":"journal-article","created":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T05:30:29Z","timestamp":1753853429000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A sparse tensor generator with efficient feature extraction"],"prefix":"10.3389","volume":"11","author":[{"given":"Tugba","family":"Torun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ameer","family":"Taweel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Didem","family":"Unat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1965","published-online":{"date-parts":[[2025,7,30]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1109\/TETC.2014.2330516","article-title":"A tensor-based approach for big data representation and dimensionality reduction","volume":"2","author":"Kuang","year":"2014","journal-title":"IEEE Trans Emerg Top Comput"},{"key":"B2","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1145\/3216122.3216152","article-title":"A tensor based data model for polystore: an application to social networks data","author":"Leclercq","year":"2018","journal-title":"Proceedings of the 22nd International Database Engineering & Applications Symposium"},{"key":"B3","doi-asserted-by":"publisher","first-page":"i10","DOI":"10.1093\/bioinformatics\/btm210","article-title":"Multiway analysis of epilepsy tensors","volume":"23","author":"Acar","year":"2007","journal-title":"Bioinformatics"},{"key":"B4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-3-642-25975-3_26","article-title":"Empirical discriminative tensor analysis for crime forecasting","volume-title":"Knowledge Science, Engineering and Management: 5th International Conference, KSEM 2011, Irvine, CA, USA, December 12-14, 2011. Proceedings 5","author":"Mu","year":"2011"},{"key":"B5","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.bspc.2013.07.001","article-title":"Noninvasive diagnosis of melanoma with tensor decomposition-based feature extraction from clinical color image","volume":"8","author":"Juki\u0107","year":"2013","journal-title":"Biomed Signal Process Control"},{"key":"B6","doi-asserted-by":"crossref","first-page":"2134","DOI":"10.1145\/3292500.3330678","article-title":"Detection of review abuse via semi-supervised binary multi-target tensor decomposition","volume-title":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","author":"Yelundur","year":"2019"},{"key":"B7","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","article-title":"Tensor decompositions and applications","volume":"51","author":"Kolda","year":"2009","journal-title":"SIAM Eev"},{"key":"B8","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/JSTSP.2015.2509907","article-title":"Tensor CP decomposition with structured factor matrices: algorithms and performance","volume":"10","author":"Goulart","year":"2015","journal-title":"IEEE J Sel Top Signal Process"},{"key":"B9","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/3330345.3330366","article-title":"Efficient and effective sparse tensor reordering","volume-title":"Proceedings of the ACM International Conference on Supercomputing","author":"Li","year":"2019"},{"key":"B10","doi-asserted-by":"publisher","first-page":"2814","DOI":"10.1109\/TPDS.2018.2841843","article-title":"Improving medium-grain partitioning for scalable sparse tensor decomposition","volume":"29","author":"Acer","year":"2018","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"B11","doi-asserted-by":"publisher","first-page":"C99","DOI":"10.1137\/16M1102744","article-title":"Parallel candecomp\/parafac decomposition of sparse tensors using dimension trees","volume":"40","author":"Kaya","year":"2018","journal-title":"SIAM J Sci Comput"},{"key":"B12","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1109\/SC.2018.00022","article-title":"HiCOO: hierarchical storage of sparse tensors","volume-title":"SC18: International Conference for High Performance Computing, Networking, Storage and Analysis","author":"Li","year":"2018"},{"key":"B13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/1.9781611976830.18","article-title":"Efficient parallel sparse symmetric Tucker decomposition for high-order tensors","volume-title":"SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21)","author":"Shivakumar","year":"2021"},{"key":"B14","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/3447818.3461703","article-title":"ALTO: adaptive linearized storage of sparse tensors","volume-title":"Proceedings of the ACM International Conference on Supercomputing","author":"Helal","year":"2021"},{"key":"B15","doi-asserted-by":"publisher","first-page":"1968","DOI":"10.1109\/TC.2021.3113028","article-title":"Input-aware sparse tensor storage format selection for optimizing MTTKRP","volume":"71","author":"Sun","year":"2021","journal-title":"IEEE Trans Comput"},{"key":"B16","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1109\/ICDE.2015.7113355","article-title":"HaTen2: billion-scale tensor decompositions","volume-title":"2015 IEEE 31st International Conference on Data Engineering","author":"Jeon","year":"2015"},{"key":"B17","unstructured":"Smith\n              S\n            \n            \n              Choi\n              JW\n            \n            \n              Li\n              J\n            \n            \n              Vuduc\n              R\n            \n            \n              Park\n              J\n            \n            \n              Liu\n              X\n            \n          \n          FROSTT: The Formidable Repository of Open Sparse Tensors and Tools\n          \n          2017"},{"key":"B18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/IPDPS.2015.27","article-title":"SPLATT: efficient and parallel sparse tensor-matrix multiplication","volume-title":"2015 IEEE International Parallel and Distributed Processing Symposium","author":"Smith","year":"2015"},{"key":"B19","article-title":"ParTI!: a parallel tensor infrastructure for data analysis","volume-title":"NIPS, Tensor-Learn Workshop","author":"Li","year":"2016"},{"key":"B20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1109\/IPDPS.2019.00023","article-title":"Load-balanced sparse MTTKRP on GPUs","author":"Nisa","year":"2019","journal-title":"2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS)"},{"key":"B21","first-page":"151","article-title":"Auto-tuning of sparse matrix-vector multiplication on graphics processors","volume-title":"International Supercomputing Conference","author":"Abu-Sufah","year":"2013"},{"key":"B22","first-page":"1","article-title":"Tensor-matrix products with a compressed sparse tensor","volume-title":"Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms","author":"Smith","year":"2015"},{"key":"B23","doi-asserted-by":"publisher","first-page":"12","DOI":"10.2307\/2346513","article-title":"The Box-M\u00faller method for generating pseudo-random normal deviates","volume":"25","author":"Golder","year":"1976","journal-title":"J R Stat Soc Ser C"},{"key":"B24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/SC41405.2020.00022","article-title":"SpTFS: Sparse tensor format selection for MTTKRP via Deep learning","volume-title":"SC20: International Conference for High Performance Computing, Networking, Storage and Analysis","author":"Sun","year":"2020"},{"key":"B25","doi-asserted-by":"crossref","unstructured":"Sun\n              Q\n            \n            \n              Liu\n              Y\n            \n            \n              Dun\n              M\n            \n            \n              Yang\n              H\n            \n            \n              Luan\n              Z\n            \n            \n              Gan\n              L\n            \n          \n          SpTFS: Sparse Tensor Format Selection\n          \n          2020","DOI":"10.1109\/SC41405.2020.00022"},{"key":"B26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/HPEC43674.2020.9286145","article-title":"Scalable data generation for evaluating mixed-precision solvers","volume-title":"2020 IEEE High Performance Extreme Computing Conference (HPEC)","author":"Luszczek","year":"2020"},{"key":"B27","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/IPDPS54959.2023.00072","article-title":"Feature-based SPMV performance analysis on contemporary devices","volume-title":"2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","author":"Mpakos","year":"2023"},{"key":"B28","doi-asserted-by":"publisher","first-page":"C424","DOI":"10.1137\/130914218","article-title":"A scalable generative graph model with community structure","volume":"36","author":"Kolda","year":"2014","journal-title":"SIAM J Sci Comput"},{"key":"B29","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1109\/CLUSTR.2008.4663802","article-title":"Reinforcement learning for automated performance tuning: Initial evaluation for sparse matrix format selection","volume-title":"2008 IEEE International Conference on Cluster Computing","author":"Armstrong","year":"2008"},{"key":"B30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3379445","article-title":"Graph generators: state of the art and open challenges","volume":"53","author":"Bonifati","year":"2020","journal-title":"ACM Comput Surv"},{"key":"B31","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1137\/110859063","article-title":"On tensors, sparsity, and nonnegative factorizations","volume":"33","author":"Chi","year":"2012","journal-title":"SIAM J Matrix Anal Appl"},{"key":"B32","first-page":"653","article-title":"Accelerating the tucker decomposition with compressed sparse tensors","volume-title":"European Conference on Parallel Processing","author":"Smith","year":"2017"},{"key":"B33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/HPEC.2012.6408676","article-title":"Efficient and scalable computations with sparse tensors","volume-title":"2012 IEEE Conference on High Performance Extreme Computing","author":"Baskaran","year":"2012"},{"volume-title":"MATLAB Tensor Toolbox","year":"2006","author":"Kolda","key":"B34"},{"key":"B35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2049662.2049663","article-title":"The University of Florida sparse matrix collection","volume":"38","author":"Davis","year":"2011","journal-title":"ACM Trans Math Softw"}],"container-title":["Frontiers in Applied Mathematics and Statistics"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fams.2025.1589033\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T05:30:33Z","timestamp":1753853433000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fams.2025.1589033\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,30]]},"references-count":35,"alternative-id":["10.3389\/fams.2025.1589033"],"URL":"https:\/\/doi.org\/10.3389\/fams.2025.1589033","relation":{},"ISSN":["2297-4687"],"issn-type":[{"type":"electronic","value":"2297-4687"}],"subject":[],"published":{"date-parts":[[2025,7,30]]},"article-number":"1589033"}}