Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004169
Yao Lu, Yufeng Chen, Li Yin, Zhiwu Li
This paper develops a deadlock detection and recovery policy for flexible manufacturing systems (FMSs). Different from traditional deadlock-handling methods, this work adds recovery transitions and related arcs rather than control places. First, the concept of a resource requirement graph is presented. It is obtained directly from the Petri net of an FMS, from which the competition for shared resources by different processes can be well represented. Second, all partial deadlocks can be discribed in linear algebraic terms by analysing the resource requirement graph. Then, we propose an algorithm of designing recovery transitions to realloate resources. The resultant net by adding recovery transitions is deadlock-free with all original reachable markings. The proposed approach is computationally efficient since it does not require to generate a reachability graph. Finally, an example is used to illustrate the presented policy.
{"title":"Optimal Transition-based Supervisors Design for Flexible Manufacturing Systems","authors":"Yao Lu, Yufeng Chen, Li Yin, Zhiwu Li","doi":"10.1109/ICNSC55942.2022.10004169","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004169","url":null,"abstract":"This paper develops a deadlock detection and recovery policy for flexible manufacturing systems (FMSs). Different from traditional deadlock-handling methods, this work adds recovery transitions and related arcs rather than control places. First, the concept of a resource requirement graph is presented. It is obtained directly from the Petri net of an FMS, from which the competition for shared resources by different processes can be well represented. Second, all partial deadlocks can be discribed in linear algebraic terms by analysing the resource requirement graph. Then, we propose an algorithm of designing recovery transitions to realloate resources. The resultant net by adding recovery transitions is deadlock-free with all original reachable markings. The proposed approach is computationally efficient since it does not require to generate a reachability graph. Finally, an example is used to illustrate the presented policy.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132760482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004155
Jian Yu, Xueqi Yang, Xiong Chen
About 90% of machine learning applications are based on supervised machine learning drives, and a relatively important task is how to obtain labels for the data. For data with clear rules and structure, a fairly satisfactory label can be obtained by simple processing and analysis. In contrast, the processing of unstructured data is more tedious and complicated for you to go home, such as text-based data, reports, images, etc. There is no predefined data model for this type of data, and the value density itself is low and ambiguous, making it very difficult to extract high- quality information from it. To this end, this paper proposes a text data annotation model that fuses domain knowledge graphs with Bayesian inference networks. The knowledge graph is used as the extraction of semantic classes and the relationship between upper and lower concept entities, and then mapping inference is performed using plain Bayes, while considering the context of the text, as a way to remove the uncertainty of fuzzy concepts. Compared with the traditional text data annotation model, this model introduces concept probability quantification to eliminate the ambiguity of inference results of knowledge graphs while fully considering the influence of human domain knowledge.
{"title":"A text analysis model based on Probabilistic-KG","authors":"Jian Yu, Xueqi Yang, Xiong Chen","doi":"10.1109/ICNSC55942.2022.10004155","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004155","url":null,"abstract":"About 90% of machine learning applications are based on supervised machine learning drives, and a relatively important task is how to obtain labels for the data. For data with clear rules and structure, a fairly satisfactory label can be obtained by simple processing and analysis. In contrast, the processing of unstructured data is more tedious and complicated for you to go home, such as text-based data, reports, images, etc. There is no predefined data model for this type of data, and the value density itself is low and ambiguous, making it very difficult to extract high- quality information from it. To this end, this paper proposes a text data annotation model that fuses domain knowledge graphs with Bayesian inference networks. The knowledge graph is used as the extraction of semantic classes and the relationship between upper and lower concept entities, and then mapping inference is performed using plain Bayes, while considering the context of the text, as a way to remove the uncertainty of fuzzy concepts. Compared with the traditional text data annotation model, this model introduces concept probability quantification to eliminate the ambiguity of inference results of knowledge graphs while fully considering the influence of human domain knowledge.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116812954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004118
Zemiao Peng, Hao Wu
A non-negative latent factorization of tensors (NLFT) model can well model the temporal pattern hidden in non-negative quality-of-service (QoS) data for predicting the unobserved ones with high accuracy. However, existing NLFT models' objective function is based on Euclidean distance, which is only a special case of $beta$-divergence. Hence, can we build a generalized NLFT model via adopting $beta$-divergence to achieve prediction accuracy gain? To tackle this issue, this paper proposes a $beta$-divergence-based NLFT model ($beta$-NLFT). Its ideas are two-fold: 1) building a learning objective with $beta$-divergence to achieve higher prediction accuracy; and 2) implementing self-adaptation of hyper-parameters to improve practicability. Experimental results generated from two dynamic QoS datasets show that the proposed $beta$-NLFT model can achieve the higher prediction accuracy than state-of-the-art models several when predicting the unobserved QoS data.
{"title":"Non-Negative Latent Factorization of Tensors Model Based on $beta$-Divergence for Time-Aware QoS Prediction","authors":"Zemiao Peng, Hao Wu","doi":"10.1109/ICNSC55942.2022.10004118","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004118","url":null,"abstract":"A non-negative latent factorization of tensors (NLFT) model can well model the temporal pattern hidden in non-negative quality-of-service (QoS) data for predicting the unobserved ones with high accuracy. However, existing NLFT models' objective function is based on Euclidean distance, which is only a special case of $beta$-divergence. Hence, can we build a generalized NLFT model via adopting $beta$-divergence to achieve prediction accuracy gain? To tackle this issue, this paper proposes a $beta$-divergence-based NLFT model ($beta$-NLFT). Its ideas are two-fold: 1) building a learning objective with $beta$-divergence to achieve higher prediction accuracy; and 2) implementing self-adaptation of hyper-parameters to improve practicability. Experimental results generated from two dynamic QoS datasets show that the proposed $beta$-NLFT model can achieve the higher prediction accuracy than state-of-the-art models several when predicting the unobserved QoS data.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132750903","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004047
Lingpeng Meng, Xudong Wang, Qi Deng, Junling He, Chuanfeng Han
The main challenge of emergency supplies distribution is addressing facility disruption caused by secondary disasters (e.g., aftershocks and landslides) and handling the uncertainty of road conditions, which can result in an increase in transportation cost and a delayed arrival time. Considering the risk of facility disruption and multiple types of vehicles, a stochastic programming model is established with the goal of minimizing the transportation cost and rental cost. Since distribution center disruption occurs frequently in practical problems, the model considers distribution center disruption instead of supplier disruption. In the first stage, the supplier transports the supplies needed to the distribution center; in the second stage, the distribution center conducts delivery according to the requirements of the affected locations. A modified evolutionary algorithm is designed to solve the proposed model for large-scale emergencies. Based on the real-world case of the Ya'an earthquake in China, numerical experiments are presented to study the applicability of the proposed model and demonstrate the effectiveness of the proposed algorithm. The numerical analysis results indicate that the proposed model can improve the robustness of the emergency supplies distribution network effectively.
{"title":"A Stochastic Programming Model for Emergency Supplies Distribution Considering Facility Disruption","authors":"Lingpeng Meng, Xudong Wang, Qi Deng, Junling He, Chuanfeng Han","doi":"10.1109/ICNSC55942.2022.10004047","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004047","url":null,"abstract":"The main challenge of emergency supplies distribution is addressing facility disruption caused by secondary disasters (e.g., aftershocks and landslides) and handling the uncertainty of road conditions, which can result in an increase in transportation cost and a delayed arrival time. Considering the risk of facility disruption and multiple types of vehicles, a stochastic programming model is established with the goal of minimizing the transportation cost and rental cost. Since distribution center disruption occurs frequently in practical problems, the model considers distribution center disruption instead of supplier disruption. In the first stage, the supplier transports the supplies needed to the distribution center; in the second stage, the distribution center conducts delivery according to the requirements of the affected locations. A modified evolutionary algorithm is designed to solve the proposed model for large-scale emergencies. Based on the real-world case of the Ya'an earthquake in China, numerical experiments are presented to study the applicability of the proposed model and demonstrate the effectiveness of the proposed algorithm. The numerical analysis results indicate that the proposed model can improve the robustness of the emergency supplies distribution network effectively.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131964678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004117
Chuan Ma, Jianhong Ye, LuLu Shuai
Predictive process monitoring belongs to one of the branches of process mining, which aims to provide information in order to proactively mitigate risks and losses. In this paper, we investigate outcome-oriented predictive process monitoring and propose a new way of sequence encoding. The approach uses Hidden Markov Models to capture the relationship between sequences and outcomes to be added to feature encoding. This method combines Hidden Markov Models with existing methods to reduce the dimensionality of the feature vectors while maintaining effective accuracy. We choose the index-based encoding and the last-state encoding as baseline, while three machine learning algorithms are selected for the experiments. The experiment results proved that our method has effective results.
{"title":"Research on Last State Based Hidden Markov Models Encoding Algorithm","authors":"Chuan Ma, Jianhong Ye, LuLu Shuai","doi":"10.1109/ICNSC55942.2022.10004117","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004117","url":null,"abstract":"Predictive process monitoring belongs to one of the branches of process mining, which aims to provide information in order to proactively mitigate risks and losses. In this paper, we investigate outcome-oriented predictive process monitoring and propose a new way of sequence encoding. The approach uses Hidden Markov Models to capture the relationship between sequences and outcomes to be added to feature encoding. This method combines Hidden Markov Models with existing methods to reduce the dimensionality of the feature vectors while maintaining effective accuracy. We choose the index-based encoding and the last-state encoding as baseline, while three machine learning algorithms are selected for the experiments. The experiment results proved that our method has effective results.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134049068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004183
Xiang-En Bai, Jing An, Zihong Yu, Hanqiu Bao, Ke-Fan Wang
As an important research topic in graph learning, the performance of node classification has been improved with the development of some new methods, among which graph neural networks (GNNs) have achieved state-of-the-art node classification performance. However, the existing GNN-based methods mainly address the classification problem with balanced distribution of node samples. However, many real application scenarios of graph data usually have a highly skewed class distribution, i.e., the majority classes occupy most of the samples while the minority classes contain only a few samples. When the nodes exhibit an imbalanced class distribution, existing GNN-based methods favor the majority class and under-represent the minority class. Therefore, we propose a novel Kernel Propagation-based model for Imbalanced Node Classification in Graph Convolutional Networks (KINC-GCN). First, we introduce a kernel propagation method as a preprocessing step to exploit higher-order structural features. The node features are enhanced by concatenating the higher-order structural feature matrix with the node feature matrix. Node embeddings are obtained from the enhanced feature and adjacency matrices by a two-layer GCN, and then a self-optimizing cluster analysis and graph reconstruction module are introduced. The self-optimizing cluster analysis module performs cluster analysis on the node embeddings to enhance the representativeness of the node embeddings. The graph reconstruction module uses an inner product decoder to reconstruct the graph structure and minimize the differences between the reconstructed graph and the original graph. The effectiveness of KINC-GCN in node classification is demonstrated by experiments on three real-world imbalanced graph datasets.
{"title":"A Kernel Propagation-Based Graph Convolutional Network Imbalanced Node Classification Model on Graph Data","authors":"Xiang-En Bai, Jing An, Zihong Yu, Hanqiu Bao, Ke-Fan Wang","doi":"10.1109/ICNSC55942.2022.10004183","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004183","url":null,"abstract":"As an important research topic in graph learning, the performance of node classification has been improved with the development of some new methods, among which graph neural networks (GNNs) have achieved state-of-the-art node classification performance. However, the existing GNN-based methods mainly address the classification problem with balanced distribution of node samples. However, many real application scenarios of graph data usually have a highly skewed class distribution, i.e., the majority classes occupy most of the samples while the minority classes contain only a few samples. When the nodes exhibit an imbalanced class distribution, existing GNN-based methods favor the majority class and under-represent the minority class. Therefore, we propose a novel Kernel Propagation-based model for Imbalanced Node Classification in Graph Convolutional Networks (KINC-GCN). First, we introduce a kernel propagation method as a preprocessing step to exploit higher-order structural features. The node features are enhanced by concatenating the higher-order structural feature matrix with the node feature matrix. Node embeddings are obtained from the enhanced feature and adjacency matrices by a two-layer GCN, and then a self-optimizing cluster analysis and graph reconstruction module are introduced. The self-optimizing cluster analysis module performs cluster analysis on the node embeddings to enhance the representativeness of the node embeddings. The graph reconstruction module uses an inner product decoder to reconstruct the graph structure and minimize the differences between the reconstructed graph and the original graph. The effectiveness of KINC-GCN in node classification is demonstrated by experiments on three real-world imbalanced graph datasets.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122985929","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004101
Hanqiu Bao, Xudong Shi, Jing An, Hao Li, Qi Kang
This paper introduces a generic multi-agent cooperative control framework using finite-time distributed model predictive control, which applies to multiple types and heterogeneous multi-agent systems with directed topology. We design a detect and avoid collisions strategy using the prediction trajectory of agents, and the agents can safely move toward their goals. The formation time upper bound of multi-agents achieves consensus are derived with given connected communication topology. Numerical simulations validated the feasibility and effectiveness of the proposed approach.
{"title":"Generic Multi-agent Cooperative Control via Finite-time Distributed MPC","authors":"Hanqiu Bao, Xudong Shi, Jing An, Hao Li, Qi Kang","doi":"10.1109/ICNSC55942.2022.10004101","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004101","url":null,"abstract":"This paper introduces a generic multi-agent cooperative control framework using finite-time distributed model predictive control, which applies to multiple types and heterogeneous multi-agent systems with directed topology. We design a detect and avoid collisions strategy using the prediction trajectory of agents, and the agents can safely move toward their goals. The formation time upper bound of multi-agents achieves consensus are derived with given connected communication topology. Numerical simulations validated the feasibility and effectiveness of the proposed approach.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129211610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004180
Honghao Zhang, Zhongwei Huang, Guangdong Tian
Design for disassembly (DFD) is a basic design technology serving the scrap and recycling stages, which can well relieve the environmental pressure and improve the economic benefits. The interval 2-tuple q-rung orthopair fuzzy sets (I2q-ROFSs) is proposed to better describe the vague of human thinking and avoid information loss/distortion during the information aggregation phase. Then, this paper proposes a weight method for the disassembly technical features of best worst method (BWM), which can get the best weight vector. The 12q-ROFSs is combined with the grey relational analysis (GRA) for the evaluation of the DFD scheme. Finally, conducting a case study and sensitivity analysis demonstrates the effectiveness of the proposed method. Thus, an effective DFD evaluation method can effectively solve the disassembly design scheme selection problem.
{"title":"A novel MADM method of interval 2-tuple q-rung orthopair fuzzy sets and GRA for DFD schemes","authors":"Honghao Zhang, Zhongwei Huang, Guangdong Tian","doi":"10.1109/ICNSC55942.2022.10004180","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004180","url":null,"abstract":"Design for disassembly (DFD) is a basic design technology serving the scrap and recycling stages, which can well relieve the environmental pressure and improve the economic benefits. The interval 2-tuple q-rung orthopair fuzzy sets (I2q-ROFSs) is proposed to better describe the vague of human thinking and avoid information loss/distortion during the information aggregation phase. Then, this paper proposes a weight method for the disassembly technical features of best worst method (BWM), which can get the best weight vector. The 12q-ROFSs is combined with the grey relational analysis (GRA) for the evaluation of the DFD scheme. Finally, conducting a case study and sensitivity analysis demonstrates the effectiveness of the proposed method. Thus, an effective DFD evaluation method can effectively solve the disassembly design scheme selection problem.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"49 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115858686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004095
LuLu Shuai, Jianhong Ye, Chuan Ma
This paper presents an improved harmony search algorithm (OP-HSA) for missing fault data processing, to find a relatively optimal missing data imputation method from the alternatives. In real life, data is usually missing due to equipment failure or staff negligence, and researchers will preprocess the missing data before using it for work. There are more than one hundred methods to impute missing data, it is not easy to find the right imputation method for missing data. Selecting the right data imputation method can get twice the result with half the effort. To solve this challenge, this paper proposes OP-HSA. In the experiment of this paper, the data processed by different imputation methods are fitted with the original dataset and the similarity error of the dataset is compared. The results show that the improved harmony search algorithm can find a more appropriate data imputation method.
{"title":"Missing Fault Data Processing Method Based On Improved Harmony Search Algorithm","authors":"LuLu Shuai, Jianhong Ye, Chuan Ma","doi":"10.1109/ICNSC55942.2022.10004095","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004095","url":null,"abstract":"This paper presents an improved harmony search algorithm (OP-HSA) for missing fault data processing, to find a relatively optimal missing data imputation method from the alternatives. In real life, data is usually missing due to equipment failure or staff negligence, and researchers will preprocess the missing data before using it for work. There are more than one hundred methods to impute missing data, it is not easy to find the right imputation method for missing data. Selecting the right data imputation method can get twice the result with half the effort. To solve this challenge, this paper proposes OP-HSA. In the experiment of this paper, the data processed by different imputation methods are fitted with the original dataset and the similarity error of the dataset is compared. The results show that the improved harmony search algorithm can find a more appropriate data imputation method.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116225355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004049
Lingyun Wang, Yin Liu, Yunshen Zhou
In real-world scenarios, datasets often perform a long-tailed distribution, making it difficult to train neural net-work models that achieve high accuracy across all classes. In this paper, we explore self-supervised learning for the purpose of learning generalized features and propose a score fusion module to integrate outputs from multiple expert models to obtain a unified prediction. Specifically, we take inspiration from the observation that networks trained on a less unbalanced subset of the distribution tend to produce better performance than networks trained on the entire dataset. However, subsets from tail classes are not adequately represented due to the limitation of data size, which means that their performance is actually unsatisfactory. Therefore, we employ self-supervised learning (SSL) on the whole dataset to obtain a more generalized and transferable feature representation, resulting in a sufficient improvement in subset performance. Unlike previous work that used knowledge distillation models to distill the models trained on a subset to get a unified student model, we propose a score fusion module that directly exploits and integrates the predictions of the subset models. We do extensive experiments on several long-tailed recognition benchmarks to demonstrate the effectiveness of our pronosed model.
{"title":"SFME: Score Fusion from Multiple Experts for Long-tailed Recognition","authors":"Lingyun Wang, Yin Liu, Yunshen Zhou","doi":"10.1109/ICNSC55942.2022.10004049","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004049","url":null,"abstract":"In real-world scenarios, datasets often perform a long-tailed distribution, making it difficult to train neural net-work models that achieve high accuracy across all classes. In this paper, we explore self-supervised learning for the purpose of learning generalized features and propose a score fusion module to integrate outputs from multiple expert models to obtain a unified prediction. Specifically, we take inspiration from the observation that networks trained on a less unbalanced subset of the distribution tend to produce better performance than networks trained on the entire dataset. However, subsets from tail classes are not adequately represented due to the limitation of data size, which means that their performance is actually unsatisfactory. Therefore, we employ self-supervised learning (SSL) on the whole dataset to obtain a more generalized and transferable feature representation, resulting in a sufficient improvement in subset performance. Unlike previous work that used knowledge distillation models to distill the models trained on a subset to get a unified student model, we propose a score fusion module that directly exploits and integrates the predictions of the subset models. We do extensive experiments on several long-tailed recognition benchmarks to demonstrate the effectiveness of our pronosed model.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"309 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114284897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：