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

NC-ALG: Graph-Based Active learning under Noisy Crowd 40

学校读者我要写书评

暂无评论

NC-ALG: Graph-Based Active Learning under Noisy Crowd

40th IEEE International Conference on Data Engineering, ICDE 2024

作者： Zhang, Wentao Wang, Yexin You, Zhenbang Li, Yang Cao, Gang Yang, Zhi Cui, Bin Center for Machine Learning Research Peking University China Key Lab of High Confidence Software Technologies Peking University China Institute of Advanced Algorithms Research Shanghai China Institute of Computational Social Science Peking University Qingdao China National Engineering Labratory for Big Data Analytics and Applications China TEG Tencent Inc. Department of Data Platform China Beijing Academy of Artificial Intelligence China

ISBN: (纸本)9798350317152

Graph Neural Networks (GNNs) have achieved great success in various data mining tasks but they heavily rely on a large number of annotated nodes, requiring considerable human efforts. Despite the effectiveness of existing GNN-based Active learning (AL) methods, they assume that the annotated lab.ls are always correct, which is contradictory to the error-prone lab.ling process in a practical crowdsourcing environment. Besides, due to this impractical assumption, existing works only focus on optimizing the node selection in AL but neglect optimizing the lab.ling process. Therefore, we present NC-ALG, the first GNN-based AL framework that optimizes both the node selection and node lab.ling process under a noisy crowd. For node selection, NC-ALG introduces a new measurement to model influence reliability and an effective influence maximization objective to select nodes. For node lab.ling, NC-ALG significantly reduces the lab.ling cost by considering the model-predicted lab.ls and the lab.ls of mirror nodes. To the best of our knowledge, this is the first attempt to consider GNN-based AL under the practical noisy crowd. Empirical studies on public datasets demonstrate that NC-ALG significantly outperforms existing methods in terms lab.ling efficiency. Notably, it only takes NC-ALG one-third of the lab.ling budget that the competitive baseline GRAIN needs to achieve an accuracy of 70.7 % on PubMed. © 2024 IEEE.

关键词： Crowdsourcing

An Ordinal Random Forest and Its Parallel Implementation with MapReduce

学校读者我要写书评

暂无评论

An Ordinal Random Forest and Its Parallel Implementation wit...

IEEE International Conference on Systems, Man and Cybernetics

作者： Shanshan Wang Junhai Zhai Sufang Zhang Hong Zhu School of Computer Science and Technology Hebei University Baoding China Key Lab. of Machine Learning and Computational Intelligence Hebei University Baoding China College of Mathematics Zhejiang Normal University Jinhua China Hebei Branch of Meteorological Cadres Training Institute China Meteorological Administration Baoding China

ISBN: (纸本)9781479986989

Ordinal decision tree (ODT) can effectively deal with monotonic classification problems. However, it is difficult for the existing ordinal decision tree algorithms to learning ODT from large data sets. Based on the variable consistency dominance based rough set approach (VC-DRSA), an ordinal random forest algorithm is proposed in this paper. Combining with the computing framework of MapReduce, the proposed ordinal random forest algorithm is paralleled on the platform of Hadoop, which improves the efficiency of the proposed algorithm. The feasibility and effectiveness of the proposed algorithm is verified by the experimental results.

关键词： Conferences Decision trees Vegetation

Sample Selection Based on K-L Divergence for Effectively Training SVM

学校读者我要写书评

暂无评论

Sample Selection Based on K-L Divergence for Effectively Tra...

IEEE International Conference on Systems, Man and Cybernetics

作者： Junhai Zhai Chang Li Ta Li Key Lab. of Machine Learning & Comput. Intell. of Hebei Province Hebei Univ. Baoding China Coll. of Math. & Comput. Sci. Hebei Univ. Baoding China

The computational time and space complexity of support vector machine (SVM) are O(n3) and O(n2) respectively, where n is the number of training samples. It is inefficient or impracticable to train an SVM on relatively large datasets. Actually, the removal of training samples that are not support vector (SVs) has no effect on constructing the optimal hyper plane. Based on this idea, this paper proposed a sample selection method which can efficiently choose the candidate SVs from original datasets. The selected samples are used to train SVM. The experimental results show that the proposed method is effective and efficient, it can efficiently reduce the computational complexity both of time and space especially on relatively large datasets.

关键词： Support vector machines Training Educational institutions Probabilistic logic Classification algorithms Neural networks Accuracy

A Review of Artificial Fish Swarm Algorithms: Recent Advances and Applications

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Pourpanah, Farhad Wang, Ran Lim, Chee Peng Wang, Xi-Zhao Yazdani, Danial College of Mathematics and Statistics Guangdong Key Lab. of Intelligent Information Processing Shenzhen University China Department of Electrical and Computer Engineering University of Windsor Canada College of Mathematics and Statistics Shenzhen Key Lab. of Advanced Machine Learning and Applications Guangdong Key Lab. of Intelligent Information Processing Shenzhen University China Institute for Intelligent Systems Research and Innovation Deakin University Australia College of Computer Science and Software Engineering Guangdong Key Lab. of Intelligent Information Processing Shenzhen University China School of Computer Science and Engineering Southern University of Science and Technology China

The Artificial Fish Swarm Algorithm (AFSA) is inspired by the ecological behaviors of fish schooling in nature, viz., the preying, swarming and following behaviors. Owing to a number of salient properties, which include flexibility, fast convergence, and insensitivity to the initial parameter settings, the family of AFSA has emerged as an effective Swarm Intelligence (SI) methodology that has been widely applied to solve real-world optimization problems. Since its introduction in 2002, many improved and hybrid AFSA models have been developed to tackle continuous, binary, and combinatorial optimization problems. This paper aims to present a concise review of the continuous AFSA, encompassing the original ASFA, its improvements and hybrid models, as well as their associated applications. We focus on articles published in high-quality journals since 2013. Our review provides insights into AFSA parameters modifications, procedure and sub-functions. The main reasons for these enhancements and the comparison results with other hybrid methods are discussed. In addition, hybrid, multi-objective and dynamic AFSA models that have been proposed to solve continuous optimization problems are elucidated. We also analyse possible AFSA enhancements and highlight future research directions for advancing AFSA-based models. Copyright © 2020, The Authors. All rights reserved.

关键词： Multiobjective optimization

A mathematical model for efficient extraction of key locations from point-cloud data in track area

学校读者我要写书评

暂无评论

Industrial Artificial Intelligence 2023年第1期1卷 1-14页

作者： Chen, Shuyue Wu, Jiaolv Lu, Jian Wang, Xizhao College of Mathematics and Statistics Shenzhen University Shenzhen China School of Software Engineering Shenzhen Institue of Information Technology Shenzhen China Shenzhen No. 3 Vocational School of Technology Shenzhen China College of Engineering Huaqiao University Quanzhou China Shenzhen Key Lab. of Advanced Machine Learning and Applications Shenzhen University Shenzhen China Guangdong Key Lab. of Intelligent Information Process Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

During the construction of a metro system, it is inevitable that deviations will occur between the excavated tunnel and the original designed scheme. As such, it is necessary to adjust the designed scheme to accommodate these discrepancies. Specifically, the adjustment of the designed scheme involves a rigorous process of repeatedly selecting and verifying the feasibility of the proposed modifications using point-cloud data obtained from the tunnel. However, this process can be considerably time-consuming due to the large-scale and potentially redundant nature of the point-cloud data. This paper proposes a mathematical model for point-cloud data acquired in measuring a mined tunnel, which may deviate from the originally designed one. The modeling, which mainly includes determining its normal plane, and building the equation of tunnel point-cloud data, is to quickly extract several key locations in the tunnel surface for modifying the original design in order to achieve a minimum error between the modified design and the mined tunnel. In comparison with the conventional processing of extracting several key locations directly from point-cloud data, our model shows a significant promotion of extraction efficiency under an acceptable error bound. The model is tested in a real tunnel point-cloud data and the testing results confirm the increase of fitting accuracy and the decrease of computational load.

关键词：

Inconsistency Distillation For Consistency:Enhancing Multi-View Clustering via Mutual Contrastive Teacher-Student Leaning

学校读者我要写书评

暂无评论

Inconsistency Distillation For Consistency:Enhancing Multi-V...

IEEE International Conference on Data Mining (ICDM)

作者： Dunqiang Liu Shu-Juan Peng Xin Liu Lei Zhu Zhen Cui Taihao Li Dept. of Comput. Sci. & Fujian Key Lab. of Big Data Intelligence and Security Huaqiao University Xiamen China Zhejiang Lab Hangzhou China Xiamen Key Lab. of Computer Vision and Pattern Recognition Huaqiao University Xiamen China Key Lab. of Computer Vision and Machine Learning (Huaqiao University) Fujian Province University Xiamen China School of Information Sci. and Eng. Shandong Normal University Jinan China School of Computer Sci. and Eng. Nanjing University of Science and Technology Nanjing China

Multi-view clustering has attracted more attention recently since many real-world data are comprised of different representations or views. Recent multi-view clustering works mainly exploit the instance consistency to obtain the shared representations across different views, and apply a single-view clustering method to perform data partitions. However, these existing methods often ignore the inconsistency of instance associations within the views, which may enlarge the intra-class diversity among the views and therefore degrade the clustering performance. To address this issue, this paper proposes an efficient mutual contrastive teacher-student leaning (MC-TSL) model to enhance the multi-view clustering, which is the first attempt to study the inconsistency distillation for consistency learning. First, the proposed MC-TSL approach exploits a view-specific encoder with two heads, an instance encoding head and a semantic distillation head, respectively, for capturing the consistent and discriminative feature representations. To be specific, the former head exploits a cross-view contrastive learning method to obtain a redundancy-free consistent representation at the instance level, while the latter head designs a mutual teacher-student learning module to capture the intra-view information at semantic level. By training these two heads in an end-to-end manner, the discriminative multi-view embeddings are efficiently obtained and refined by minimizing the weighted sum of the reconstruction loss, contrastive loss and contrast distillation loss. Extensive experiments verify the superiorities of the proposed MC-TSL framework and show its competitive clustering performances.

关键词： Training learning systems Clustering methods Semantics Encoding Data mining

A study on the uncertainty of convolutional layers in deep neural networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Shen, Haojing Chen, Sihong Wang, Ran Big Data Institute College of Computer Science and Software Engineering Guangdong Key Lab. of Intelligent Information Processing Shenzhen University ShenzhenGuangdong518060 China College of Mathematics and Statistics Shenzhen University Shenzhen518060 China Shenzhen Key Laboratory of Advanced Machine Learning and Applications Shenzhen University Shenzhen518060 China

This paper shows a Min-Max property existing in the connection weights of the convolutional layers in a neural network structure, i.e., the LeNet. Specifically, the Min-Max property means that, during the back propagation-based training for LeNet, the weights of the convolutional layers will become far away from their centers of intervals, i.e., decreasing to their minimum or increasing to their maximum. From the perspective of uncertainty, we demonstrate that the Min-Max property corresponds to minimizing the fuzziness of the model parameters through a simplified formulation of convolution. It is experimentally confirmed that the model with the Min-Max property has a stronger adversarial robustness, thus this property can be incorporated into the design of loss function. This paper points out a changing tendency of uncertainty in the convolutional layers of LeNet structure, and gives some insights to the interpretability of convolution. © 2020, CC-BY.

关键词： Convolution

Adversarial learning with Cost-Sensitive Classes

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Shen, Haojing Chen, Sihong Wang, Ran Wang, Xizhao Big Data Institute College of Computer Science and Software Engineering Guangdong Key Lab. of Intelligent Information Processing Shenzhen University Guangdong Shenzhen518060 China The College of Mathematics and Statistics Shenzhen University Shenzhen518060 China The Shenzhen Key Laboratory of Advanced Machine Learning and Applications Shenzhen University Shenzhen518060 China

It is necessary to improve the performance of some special classes or to particularly protect them from attacks in adversarial learning. This paper proposes a framework combining cost-sensitive classification and adversarial learning together to train a model that can distinguish between protected and unprotected classes, such that the protected classes are less vulnerable to adversarial examples. We find in this framework an interesting phenomenon during the training of deep neural networks, called Min-Max property, that is, the absolute values of most parameters in the convolutional layer approach zero while the absolute values of a few parameters are significantly larger becoming bigger. Based on this Min-Max property which is formulated and analyzed in a view of random distribution, we further build a new defense model against adversarial examples for adversarial robustness improvement. An advantage of the built model is that it performs better than the standard one and can combine with adversarial training to achieve an improved performance. It is experimentally confirmed that, regarding the average accuracy of all classes, our model is almost as same as the existing models when an attack does not occur and is better than the existing models when an attack occurs. Specifically, regarding the accuracy of protected classes, the proposed model is much better than the existing models when an attack occurs. © 2021, CC BY.

关键词： Deep neural networks

Incorporating Hidden Layer representation into Adversarial Attacks and Defences

学校读者我要写书评

暂无评论

arXiv 2020年

In this paper, we propose a defence strategy to improves adversarial robustness incorporating hidden layer representation. The key of this defence strategy aims to compress or filter input’s information including adversarial perturbation. And this defence strategy can be regarded as an activation function which can be applied any kind of neural networks. We also prove theoretically the effectiveness of this defense strategy under certain conditions. Besides, incorporating hidden layer representation we propose three types of adversarial attacks to generate three types of adversarial examples, respectively. The experiments show that our defence method can significantly improve the adversarial robustness of deep neural networks which achieves the state-of-the-art performance even though we do not adopt adversarial training. © 2020, CC BY.

关键词： Deep neural networks