{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:32:30Z","timestamp":1777732350816,"version":"3.51.4"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51365019"],"award-info":[{"award-number":["51365019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1016\/j.ins.2025.122490","type":"journal-article","created":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T08:54:18Z","timestamp":1752569658000},"page":"122490","update-policy":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A multidimensional feature grouping sampling algorithm based on dynamic feedback of prior bias"],"prefix":"10.1016","volume":"719","author":[{"given":"Yunwei","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Zongkai","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Fang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jinguo","family":"You","sequence":"additional","affiliation":[]},{"given":"Xiaoxia","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2025.122490_br0010","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1109\/TNNLS.2019.2909425","article-title":"Labin: balanced min cut for large-scale data","volume":"31","author":"Xiaojun","year":"2020","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.ins.2025.122490_br0020","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/j.knosys.2018.09.007","article-title":"A stratified sampling based clustering algorithm for large-scale data","volume":"163","author":"Zhao","year":"2018","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.ins.2025.122490_br0030","series-title":"Sampling","author":"Thompson","year":"2012"},{"key":"10.1016\/j.ins.2025.122490_br0040","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.aej.2025.01.057","article-title":"A novel approach for estimation population mean with dual use of in stratified random sampling","volume":"119","author":"Alzahrani","year":"2025","journal-title":"Alex. Eng. J."},{"key":"10.1016\/j.ins.2025.122490_br0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijepes.2022.108813","article-title":"Cluster-based stratified sampling for fast reliability evaluation of composite power systems based on sequential Monte Carlo simulation","volume":"147","author":"Cervan","year":"2023","journal-title":"Int. J. Electr. Power Energy Syst."},{"key":"10.1016\/j.ins.2025.122490_br0060","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1287\/mnsc.29.6.715","article-title":"Multivariate stratified sampling by optimization","volume":"29","author":"Mulvey","year":"1983","journal-title":"Manag. Sci."},{"key":"10.1016\/j.ins.2025.122490_br0070","series-title":"Improving Decision Tree Performance Through Induction- and Cluster-Based Stratified Sampling, vol. 3177","first-page":"339","author":"Gill","year":"2004"},{"key":"10.1016\/j.ins.2025.122490_br0080","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1109\/TKDE.2019.2903410","article-title":"Ultra-scalable spectral clustering and ensemble clustering","volume":"32","author":"Huang","year":"2020","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2025.122490_br0090","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/335191.335384","article-title":"Density biased sampling: an improved method for data mining and clustering","volume":"29","author":"Palmer","year":"2000","journal-title":"ACM SIGMOD Conf."},{"key":"10.1016\/j.ins.2025.122490_br0100","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.125688","article-title":"Negative sampling strategy based on multi-hop neighbors for graph representation learning","volume":"263","author":"Zhang","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2025.122490_br0110","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.neucom.2018.04.088","article-title":"Boosting the performance of over-sampling algorithms through under-sampling the minority class","volume":"343","author":"de Morais","year":"2019","journal-title":"Neurocomputing"},{"key":"10.1016\/j.ins.2025.122490_br0120","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.119621","article-title":"Tdmo: dynamic multi-dimensional oversampling for exploring data distribution based on extreme gradient boosting learning","volume":"649","author":"Jia","year":"2023","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2025.122490_br0130","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1109\/TKDE.2020.2985965","article-title":"Gaussian distribution based oversampling for imbalanced data classification","volume":"34","author":"Xie","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2025.122490_br0140","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.120351","article-title":"Two-step ensemble under-sampling algorithm for massive imbalanced data classification","volume":"665","author":"Bai","year":"2024","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2025.122490_br0150","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.105959","article-title":"Swsel: sliding window-based selective ensemble learning for class-imbalance problems","volume":"121","author":"Dai","year":"2023","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.ins.2025.122490_br0160","doi-asserted-by":"crossref","DOI":"10.1016\/j.cma.2022.115671","article-title":"A comprehensive study of non-adaptive and residual-based adaptive sampling for physics-informed neural networks","volume":"403","author":"Wu","year":"2023","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"10.1016\/j.ins.2025.122490_br0170","doi-asserted-by":"crossref","DOI":"10.1016\/j.cma.2025.117781","article-title":"On adaptive sampling techniques for metamodels based on nurbs entities from unstructured data","volume":"437","author":"Zani","year":"2025","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"10.1016\/j.ins.2025.122490_br0180","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2024.108551","article-title":"A simple rapid sample-based clustering for large-scale data","volume":"133","author":"Chen","year":"2024","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.ins.2025.122490_br0190","doi-asserted-by":"crossref","first-page":"3688","DOI":"10.1016\/j.patcog.2015.05.006","article-title":"Stratified feature sampling method for ensemble clustering of high dimensional data","volume":"48","author":"Jing","year":"2015","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.ins.2025.122490_br0200","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115518","article-title":"Birchscan: a sampling method for applying dbscan to large datasets","volume":"184","author":"de Moura Ventorim","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2025.122490_br0210","article-title":"A sampling-based density peaks clustering algorithm for large-scale data","volume":"136","author":"Shifei","year":"2023","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.ins.2025.122490_br0220","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.neunet.2009.11.009","article-title":"Data splitting for artificial neural networks using som-based stratified sampling","volume":"23","author":"May","year":"2010","journal-title":"Neural Netw."},{"key":"10.1016\/j.ins.2025.122490_br0230","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.119661","article-title":"A subgraph sampling method for training large-scale graph convolutional network","volume":"649","author":"Zhang","year":"2023","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2025.122490_br0240","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.neunet.2023.03.015","article-title":"A learnable sampling method for scalable graph neural networks","volume":"162","author":"Zhao","year":"2023","journal-title":"Neural Netw."},{"key":"10.1016\/j.ins.2025.122490_br0250","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00224065.2019.1611354","article-title":"A review of some sampling and aggregation strategies for basic statistical process monitoring","volume":"53","author":"Zwetsloot","year":"2021","journal-title":"J. Qual. Technol."},{"key":"10.1016\/j.ins.2025.122490_br0260","first-page":"69","article-title":"A short review on different clustering techniques and their applications","volume":"937","author":"Ghosal","year":"2019","journal-title":"Adv. Intell. Syst. Comput."},{"key":"10.1016\/j.ins.2025.122490_br0270","first-page":"3001","article-title":"Robust fuzzy k-means clustering with shrunk patterns learning","volume":"35","author":"Zhao","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2025.122490_br0280","doi-asserted-by":"crossref","first-page":"3953","DOI":"10.1109\/TVCG.2020.2995100","article-title":"Interactive steering of hierarchical clustering","volume":"27","author":"Yang","year":"2021","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"10.1016\/j.ins.2025.122490_br0290","first-page":"226","article-title":"A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise","volume":"vol. 96","author":"Ester","year":"1996"},{"key":"10.1016\/j.ins.2025.122490_br0300","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1109\/TCYB.2014.2358564","article-title":"Large scale spectral clustering via landmark-based sparse representation","volume":"45","author":"Cai","year":"2015","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.ins.2025.122490_br0310","first-page":"3560","article-title":"Learnable weighting of intra-attribute distances for categorical data clustering with nominal and ordinal attributes","volume":"44","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.ins.2025.122490_br0320","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2022.103603","article-title":"Odd-distance and right-equidistant sets in the maximum and Manhattan metrics","volume":"107","author":"Golovanov","year":"2023","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.ins.2025.122490_br0330","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.neucom.2022.05.052","article-title":"Manhattan-distance iou loss for fast and accurate bounding box regression and object detection","volume":"500","author":"Yanyun","year":"2022","journal-title":"Neurocomputing"},{"key":"10.1016\/j.ins.2025.122490_br0340","doi-asserted-by":"crossref","DOI":"10.1016\/j.bspc.2023.104952","article-title":"Smoothing filter design: a general framework","volume":"85","author":"Kheirati Roonizi","year":"2023","journal-title":"Biomed. Signal Process. Control"},{"key":"10.1016\/j.ins.2025.122490_br0350","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1109\/TNNLS.2019.2911118","article-title":"From whole to part: reference-based representation for clustering categorical data","volume":"31","author":"Zheng","year":"2020","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.ins.2025.122490_br0360","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2023.110030","article-title":"Adaptive local principal component analysis improves the clustering of high-dimensional data","volume":"146","author":"Migenda","year":"2024","journal-title":"Pattern Recognit."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S002002552500622X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S002002552500622X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T11:04:56Z","timestamp":1777460696000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S002002552500622X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":36,"alternative-id":["S002002552500622X"],"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1016\/j.ins.2025.122490","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A multidimensional feature grouping sampling algorithm based on dynamic feedback of prior bias","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1016\/j.ins.2025.122490","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"122490"}}