检索结果-内蒙古大学图书馆

Multi-dimensional Classification via Selective Feature Augmentation

Machine Intelligence Research 2022年第1期19卷 38-51页

作者： Bin-Bin Jia Min-Ling Zhang School of Computer Science and Engineering Southeast UniversityNanjing 210096China College of Electrical and Information Engineering Lanzhou University of TechnologyLanzhou 730050China Key Laboratory of Computer Network and Information Integration Southeast UniversityMinistry of EducationChina

In multi-dimensional classification(MDC), the semantics of objects are characterized by multiple class spaces from different dimensions. Most MDC approaches try to explicitly model the dependencies among class spaces in output space. In contrast, the recently proposed feature augmentation strategy, which aims at manipulating feature space, has also been shown to be an effective solution for MDC. However, existing feature augmentation approaches only focus on designing holistic augmented features to be appended with the original features, while better generalization performance could be achieved by exploiting multiple kinds of augmented *** this paper, we propose the selective feature augmentation strategy that focuses on synergizing multiple kinds of augmented ***, by assuming that only part of the augmented features is pertinent and useful for each dimension′s model induction, we derive a classification model which can fully utilize the original features while conduct feature selection for the augmented features. To validate the effectiveness of the proposed strategy, we generate three kinds of simple augmented features based on standard k NN, weighted k NN, and maximum margin techniques, respectively. Comparative studies show that the proposed strategy achieves superior performance against both state-of-the-art MDC approaches and its degenerated versions with either kind of augmented features.

关键词： Machine learning multi-dimensional classification feature augmentation feature selection class dependencies

来源：评论

学校读者我要写书评

暂无评论

Improving Speech Enhancement by Cross- and Sub-band Processing with State Space Model

Improving Speech Enhancement by Cross- and Sub-band Processi...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Li, Jizhen Tu, Weiping Yang, Yuhong Xu, Xinmeng Zhang, Yiqun Ren, Yanzhen NERCMS School of Computer Science Hubei Luojia Laboratory Wuhan University China Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University China School of Cyber Science and Engineering Wuhan University China

ISBN: (纸本)9798350368741

Recently, the state space model (SSM) represented by Mamba has shown remarkable performance in long-term sequence modeling tasks, including speech enhancement. However, due to substantial differences in sub-band features, applying the same SSM to all sub-bands limits its inference capability. Additionally, when processing each time frame of the time-frequency representation, the SSM may forget certain high-frequency information of low energy, making the restoration of structure in the high-frequency bands challenging. For this reason, we propose Cross- and Sub-band Mamba (CSMamba). To assist the SSM in handling different sub-band features flexibly, we propose a band split block that splits the full-band into four sub-bands with different widths based on their information similarity. We then allocate independent weights to each subband, thereby reducing the inference burden on the SSM. Furthermore, to mitigate the forgetting of low-energy information in the high-frequency bands by the SSM, we introduce a spectrum restoration block that enhances the representation of the cross-band features from multiple perspectives. Experimental results on the DNS Challenge 2021 dataset demonstrate that CSMamba outperforms several state-of-the-art (SOTA) speech enhancement methods in three objective evaluation metrics with fewer parameters. © 2025 IEEE.

关键词： band split spectrum restoration speech enhancement state space model

来源：评论

学校读者我要写书评

暂无评论

Learning Label Shift Correction for Test-Agnostic Long-Tailed Recognition 41

Learning Label Shift Correction for Test-Agnostic Long-Taile...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Wei, Tong Mao, Zhen Zhou, Zi-Hao Wan, Yuanyu Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China School of Software Technology Zhejiang University Ningbo China

Long-tail learning primarily focuses on mitigating the label distribution shift between long-tailed training data and uniformly distributed test data. However, in real-world applications, we often encounter a more intricate challenge where the test label distribution is agnostic. To address this problem, we first theoretically establish the substantial potential for reducing the generalization error if we can precisely estimate the test label distribution. Motivated by the theoretical insight, we introduce a simple yet effective solution called label shift correction (LSC). LSC estimates the test label distribution within the proposed framework of generalized black box shift estimation, and adjusts the predictions from a pre-trained model to align with the test distribution. Theoretical analyses confirm that accurate estimation of test label distribution can effectively reduce the generalization error. Extensive experimental results demonstrate that our method significantly outperforms previous state-of-the-art approaches, especially when confronted with non-uniform test label distribution. Notably, the proposed method is general and complements existing long-tail learning approaches, consistently improving their performance. The source code is available at https://***/Stomach-ache/label-shift-correction. Copyright 2024 by the author(s)

关键词： Black-box testing

来源：评论

学校读者我要写书评

暂无评论

LASS: A Novel and Economical Data Augmentation Framework Based on Language Models for Debiasing Opinion Summarization 31

LASS: A Novel and Economical Data Augmentation Framework Bas...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Zhang, Yanyue Li, Pengfei Lai, Yilong He, Yulan Zhou, Deyu School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University China Department of Informatics King's College London United Kingdom The Alan Turing Institute United Kingdom

ISBN: (纸本)9798891761964

As more than 70% of reviews in the existing opinion summary data set are positive, current opinion summarization approaches are hesitant to generate negative summaries given the input of negative texts. To address such sentiment bias, a direct approach without the reliance on a specific structure is to generate additional data based on large language models to balance the emotional distribution of the dataset. However, large-scale data augmentation based on large language models faces an apparent disadvantage, the expensive costs. Therefore, in this paper, we propose LASS, a novel data augmentation framework based on both LArge and Small language models for debiaSing opinion summarization. Specifically, a small number of synthesized negative reviews is obtained by rewriting the positive text via a large language model. Then, a disentangle reconstruction model is trained based on the generated data. After training, a large amount of synthetic data can be obtained by decoding the new representation obtained from the combination of different sample representations and filtering based on perplexity degree and sentiment classification. Experiments have proved that LASS can effectively alleviate emotional bias, similar to using only large models, but in a more economical way. © 2025 Association for Computational Linguistics.

关键词： Data assimilation

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Text Classification for Judicial Texts via Dual Graph and Label Feature Fusion 10

Multi-Label Text Classification for Judicial Texts via Dual ...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Gu, Qiliang Lu, Qin Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan China

ISBN: (纸本)9798331520861

The legal judgement prediction (LJP) of judicial texts represents a multi-label text classification (MLTC) problem, which in turn involves three distinct tasks: the prediction of charges, legal articles, and terms of penalty. Nevertheless, extant multi-label text classification models tend to eschew the consideration of multiple correlations and semantic information between labels when predicting judicial texts, which may result in the loss of pertinent information. Furthermore, these models do not take full advantage of the local and overall information of the labels in the process of selecting appropriate labels for the text using the multi-head attention mechanism. To address these issues, we propose a new model, BGFLFF, which explores label correlation and semantics among the three tasks by employing Graph Convolutional network (GCN) and multi-head attention mechanisms. In particular, we propose a Bi-Graph Fusion GCN (BGF-GCN), which fuses the co-occurrence matrix of labels with the cosine similarity matrix, thereby fully exploiting the multiple correlations between labels. Furthermore, prior to embedding the tags, the interpretations of the labels are obtained via Google in order to enhance the semantic information between the labels. To further reinforce the interconnections between labels and text and more effectively comprehend the interrelationships between the three tasks, we propose a Multi-Head Label Feature Fusion Attentional Mechanism (MH-LFFAtt), which assigns distinct weights to the pertinent label information in the text by fusing the local and overall features of the labels. The experimental results demonstrate that the F1 score exhibits an improvement of up to 2. 2 8 % and a minimum of 1. 2 9 % across the various tasks of the two datasets. This evidence substantiates the assertion that BGFLFF outperforms the existing baseline model. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Pseudonym Exchange-Based Traceable Location Privacy Protection Scheme for IoV

A Pseudonym Exchange-Based Traceable Location Privacy Protec...

引用

2023 International Conference on networking and network Applications, NaNA 2023

作者： Ma, Weigang Yu, Yaping Wang, Yichuan Liu, Xiaoxue Wang, Zhoukai School of Computer Science and Engineering Xi'an University of Technology Xi'an China Shaanxi Key Laboratory for Network Computing and Security Technology China

ISBN: (纸本)9798350327380

Internet of Vehicles (IoV) is a network built by communicating entities such as vehicles and roadside infrastructure, etc. The entities can communicate with each other, sharing data and providing services. However, the openness and interoperability (location services) of IoV makes the communication entity vulnerable to attacks. when the vehicle requests location services, it will expose its own location information, which will cause serious personal safety problems. To address the location privacy leakage problem in the IoV, this paper proposes a pseudonym exchange-based traceable location privacy protection scheme for IoV. Our scheme not only provides location privacy protection, but has the following properties: First, the whole pseudonym exchange process does not require trusted third-party participation;Second, each vehicle performs a series of hash operations on several dynamic anonyms and obtains a corresponding fixed-length hash value as the corresponding account in order to cut off the connection between the real identity, which is different in each run. If a vehicle is compromised and utilized to launch attack, the trusted center (CA) can also recover his/her real identity;Last, the experimental results show that the pseudonym exchange process and pseudonym update process cost less time compared to relevant literature. Hence, these features make our scheme very suitable for computation-limited mobile devices compared with other related existing schemes. © 2023 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Rail Transit Event Extraction based on the Fusion of Semantic and Local Dependency Features 15

Rail Transit Event Extraction based on the Fusion of Semanti...

引用

15th IEEE International Conference on Knowledge Graph, ICKG 2024

作者： Chen, Qiang Meng, Haining Bao, Yihao Yang, Mingsong Tong, Xinyu Zhao, Qin Khan, Muhammad Bilal Hei, Xinhong Xi'an University of Technology School of Computer Science and Engineering Xi'an China Xi'an University of Technology School of Computer Science and Engineering Shaanxi Key Laboratory of Network Computing and Security Technology Xi'an China Xi'an University of Technology School of Civil Engineering and Architecture Xi'an China

ISBN: (纸本)9798331508821

Event extraction in rail transit plays a vital role in all stages of design, construction, and final acceptance. Event extraction is a key part of building event logic graph (ELG). However, the difficulty in obtaining semantic features and event local dependencies poses a challenge to accurate event extraction, which hinders the informatization and intelligent development of rail transit projects. To address these challenges, we proposes an event extraction method that fuses semantic and local dependency features. The study initially preprocesses the rail transit design codes dataset and performs sequence labeling. Then, the event trigger words are mined by combining the term frequency-inverse document frequency (TF-IDF) and minimum edit distance (MED) algorithms. Based on the semantic similarity measurement method and the trigger word mining results, the features representation of event semantic information is enhanced by using the Bidirectional Encoder Representations from Transformers (BERT) model and Bi-directional Long Short-Term Memory (BiLSTM) model. At the same time, event arguments are mined and a local dependency graph is generated based on their mining results, and then the enhanced local dependency features are obtained by using the graph convolutional network (GCN). Finally, the event semantic features and local dependency features are fused, and the conditional random field (CRF) is used to predict the labels to obtain the event extraction results. Through the comparison with five baseline methods on the datasets of rail transit design codes, it is found that the Precision, Recall, and F1 score of the proposed method are improved, with an average improvement of 9.604% on Precision, 9.342% on Recall, and 9.730% on F1 score, respectively. The contribution of the sub-modules to the overall performance is further evaluated through ablation experiments, which confirms the effectiveness and feasibility of the proposed method. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Novel On-Demand Service Architecture for Efficient Cloud-Edge Collaboration

A Novel On-Demand Service Architecture for Efficient Cloud-E...

引用

2023 International Conference on networking and network Applications, NaNA 2023

作者： Zhang, Yaling Chen, Jingjing Wang, Yichuan Xiao, Yeqiu Liu, Xiaoxue School of Computer Science and Engineering Xi'an University of Technology Xi'an China Shaanxi Key Laboratory for Network Computing and Security Technology China

ISBN: (纸本)9798350327380

With the advent of 5G era, the model of cloud-edge collaboration is used to handle massive data computing tasks with significant superiority. However, this architecture still uses the traditional web service model, which has problems such as single service and low resource utilization during the interaction between users and remote web servers. In this paper, we propose a novel on-demand service architecture that changes the traditional inefficient network service approach and skews the entire network service to the user. By fine- grained division of users' demands and hosting them in the corresponding functional servers for processing, the resolution of users' demands is no longer restricted by the services provided by the server, thus realizing 'information to people and services on demand'. Experiments show that the new on- demand service architecture reduces the latency by 33.3%, improves the quality and efficiency of information services, and realizes a more proactive and flexible information service model, which is more suitable for users' needs. © 2023 IEEE.

关键词： Information services

来源：评论

学校读者我要写书评

暂无评论

DDoS Attack Detection Based on Information Entropy Feature Extraction in Software Defined networks

DDoS Attack Detection Based on Information Entropy Feature E...

引用

2023 International Conference on networking and network Applications, NaNA 2023

作者： Ji, Wenjiang Yang, Yixin Zhang, Yaling Wang, Yichuan Tian, Mengjie Qiu, Yuan Xi'an University of Technology School of Computer Science and Engineering Xi'an China Shaanxi Key Laboratory for Network Computing and Security Technology China

ISBN: (纸本)9798350327380

Distributed Denial of Service(DDoS) attacks target the forwarding-control separation feature of Software-Defined networking(SDN) to launch attacks, causing network disruptions. Therefore security against DDoS attack detection for SDN controllers is the focus of current research. This paper proposes an Extreme Gradient Boosting (XGBoost) DDoS attack detection algorithm based on a combination of information gain and recursive feature elimination algorithms. We evaluated the performance of the method using the CICDDoS2019 dataset. This method works well in multi-classification model for attack detection with an accuracy of 93.41%. © 2023 IEEE.

关键词： Software defined networking

来源：评论

学校读者我要写书评

暂无评论

Dual Radial-Resonant Wide Beamwidth Circular Sector Microstrip Patch Antennas

引用

Chinese Journal of Electronics 2023年第4期32卷 710-719页

作者： MAO Xiaohui LU Wenjun JI Feiyan XING Xiuqiong ZHU Lei Jiangsu Key Laboratory of Wireless Communications Nanjing University of Posts and Telecommunications Key Laboratory of Wireless Sensor Network & Communication Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences Department of Electrical and Computer Engineering Faculty of Science and Technology University of Macau

In this article, a design approach to a radial-resonant wide beamwidth circular sector patch antenna is advanced. As properly evolved from a U-shaped d ipole, a prototype magnetic dipole can be fit in the radial direction of a circular sector patch radiator, with its length set as the positive odd-integer multiples of onequarter wavelength. In this way, multiple TM0m（m = 1,2,...） modes resonant circular sector patch antenna with short-circuited circumference and widened E-plane beamwidth can be realized by proper excitation and perturbations. Prototype antennas are then designed and fabricated to validate the design approach. Experimental results reveal that the E-plane beamwidth of a dual-resonant antenna fabricated on air/Teflon substrate can be effectively broadened to 128°/120°, with an impedance bandwidth of 17.4%/7.1%, respectively. In both cases, the antenna heights are strictly limited to no more than 0.03-guided wavelength. It is evidently validated that the proposed approach can effectively enhance the operational bandwidth and beamwidth of a microstrip patch antenna while maintaining its inherent low profile merit.

关键词： Geometry Patch antennas Perturbation methods Prototypes Magnetic resonance Microstrip antennas Bandwidth

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：