{"title":"基于正权恢复和隐式层次信息的不完全层次数据特征选择。","authors":"Jianhua Dai, Shiyu Wei","doi":"10.1109/TNNLS.2026.3736598","DOIUrl":null,"url":null,"abstract":"<p><p>In real-world applications, hierarchical data with complex category structures pose significant challenges due to high dimensionality and potential incompleteness. Existing studies on hierarchical feature selection assume data are complete, without considering incomplete hierarchical data. However, in practice, obtaining a complete and uncorrupted feature space can be challenging due to physical, technical, and cost constraints in data collection. To address this issue, we propose a hierarchical feature selection method for incomplete hierarchical data. First, weight amendment matrices are introduced to shift the primary missing-data compensation from the feature space to the projection-weight space under hierarchical structural guidance. Second, we establish a hierarchical interaction framework that explicitly captures the implicit relationship between the weight amendment matrix and the hierarchical weight matrix via constrained optimization. Third, we design a sparse hierarchical regularization term that adaptively adjusts feature weights based on hierarchy levels. Extensive experiments on benchmark datasets demonstrate the proposed approach's superior performance over state-of-the-art methods, validating its enhanced effectiveness and progress in addressing the target problem domain.</p>","PeriodicalId":13303,"journal":{"name":"IEEE transactions on neural networks and learning systems","volume":"PP ","pages":""},"PeriodicalIF":9.7000,"publicationDate":"2026-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Feature Selection for Incomplete Hierarchical Data by Positive Weight Recovery and Implicit Hierarchical Information.\",\"authors\":\"Jianhua Dai, Shiyu Wei\",\"doi\":\"10.1109/TNNLS.2026.3736598\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>In real-world applications, hierarchical data with complex category structures pose significant challenges due to high dimensionality and potential incompleteness. Existing studies on hierarchical feature selection assume data are complete, without considering incomplete hierarchical data. However, in practice, obtaining a complete and uncorrupted feature space can be challenging due to physical, technical, and cost constraints in data collection. To address this issue, we propose a hierarchical feature selection method for incomplete hierarchical data. First, weight amendment matrices are introduced to shift the primary missing-data compensation from the feature space to the projection-weight space under hierarchical structural guidance. Second, we establish a hierarchical interaction framework that explicitly captures the implicit relationship between the weight amendment matrix and the hierarchical weight matrix via constrained optimization. Third, we design a sparse hierarchical regularization term that adaptively adjusts feature weights based on hierarchy levels. Extensive experiments on benchmark datasets demonstrate the proposed approach's superior performance over state-of-the-art methods, validating its enhanced effectiveness and progress in addressing the target problem domain.</p>\",\"PeriodicalId\":13303,\"journal\":{\"name\":\"IEEE transactions on neural networks and learning systems\",\"volume\":\"PP \",\"pages\":\"\"},\"PeriodicalIF\":9.7000,\"publicationDate\":\"2026-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE transactions on neural networks and learning systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1109/TNNLS.2026.3736598\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on neural networks and learning systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/TNNLS.2026.3736598","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Feature Selection for Incomplete Hierarchical Data by Positive Weight Recovery and Implicit Hierarchical Information.
In real-world applications, hierarchical data with complex category structures pose significant challenges due to high dimensionality and potential incompleteness. Existing studies on hierarchical feature selection assume data are complete, without considering incomplete hierarchical data. However, in practice, obtaining a complete and uncorrupted feature space can be challenging due to physical, technical, and cost constraints in data collection. To address this issue, we propose a hierarchical feature selection method for incomplete hierarchical data. First, weight amendment matrices are introduced to shift the primary missing-data compensation from the feature space to the projection-weight space under hierarchical structural guidance. Second, we establish a hierarchical interaction framework that explicitly captures the implicit relationship between the weight amendment matrix and the hierarchical weight matrix via constrained optimization. Third, we design a sparse hierarchical regularization term that adaptively adjusts feature weights based on hierarchy levels. Extensive experiments on benchmark datasets demonstrate the proposed approach's superior performance over state-of-the-art methods, validating its enhanced effectiveness and progress in addressing the target problem domain.
期刊介绍:
The focus of IEEE Transactions on Neural Networks and Learning Systems is to present scholarly articles discussing the theory, design, and applications of neural networks as well as other learning systems. The journal primarily highlights technical and scientific research in this domain.