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

Consensus algorithms for biased labeling in crowdsourcing

学校读者我要写书评

暂无评论

information Sciences 2017年 382-383卷 254-273页

作者： Jing Zhang Victor S. Sheng Qianmu Li Jian Wu Xindong Wu School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing 210094 P. R. China Key Laboratory of Image and Video Understanding for Social Safety Nanjing University of Science and Technology Nanjing 210094 P. R. China Department of Computer Science University of Central Arkansas Conway AR 72035 USA Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing 210044 P. R. China Institute of Intelligent Information Processing and Application Soochow University Suzhou 215006 P. R. China School of Computing and Informatics University of Louisiana at Lafayette LA 70504 USA

Although it has become an accepted lay view that when labeling objects through crowdsourcing systems, non-expert annotators often exhibit biases, this argument lacks sufficient evidential observation and systematic empirical study. This paper initially analyzes eight real-world datasets from different domains whose class labels were collected from crowdsourcing systems. Our analyses show that biased labeling is a systematic tendency for binary categorization; in other words, for a large number of annotators, their labeling qualities on the negative class (supposed to be the majority) are significantly greater than are those on the positive class (minority). Therefore, the paper empirically studies the performance of four existing EM-based consensus algorithms , DS, GLAD, RY, and ZenCrowd, on these datasets. Our investigation shows that all of these state-of-the-art algorithms ignore the potential bias characteristics of datasets and perform badly although they model the complexity of the systems. To address the issue of handling biased labeling, the paper further proposes a novel consensus algorithm, namely adaptive weighted majority voting (AWMV), based on the statistical difference between the labeling qualities of the two classes. AWMV utilizes the frequency of positive labels in the multiple noisy label set of each example to obtain a bias rate and then assigns weights derived from the bias rate to negative and positive labels. Comparison results among the five consensus algorithms (AWMV and the four existing) show that the proposed AWMV algorithm has the best overall performance. Finally, this paper notes some potential related topics for future study.

关键词：

Weight-based Channel-model Matrix Framework provides a reasonable solution for EEG-based cross-dataset emotion recognition

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Chen, Huayu He, Huanhuan Zhu, Jing Sun, Shuting Li, Jianxiu Shao, Xuexiao Li, Junxiang Li, Xiaowei Hu, Bin Gansu Provincial Key Laboratory of Wearable Computing School of Information Science and Engineering Lanzhou University Lanzhou China Brain Health Engineering Laboratory School of Medical Technology Beijing Institute of Technology Beijing China School of Information Science and Engineering Inner Mongolia University Inner Mongolia China Shandong Academy of Intelligent Computing Technology Jinan China Chinese Academy of Sciences Center for Excellence in Brain Science and Intelligence Technology Shanghai Institutes for Biological Sciences Chinese Academy of Sciences Shanghai China Joint Research Center for Cognitive Neurosensor Technology of Lanzhou University Institute of Semiconductors Chinese Academy of Sciences Lanzhou China Open Source Software and Real-Time System Lanzhou University Ministry of Education Lanzhou China

Cross-dataset emotion recognition as an extremely challenging task in the field of EEG-based affective computing is influenced by many factors, which makes the universal models yield unsatisfactory results. Facing the situation that lacks EEG information decoding research, we first analyzed the impact of different EEG information(individual, session, emotion and trial) for emotion recognition by sample space visualization, sample aggregation phenomena quantification, and energy pattern analysis on five public datasets. Based on these phenomena and patterns, we provided the processing methods and interpretable work of various EEG differences. Through the analysis of emotional feature distribution patterns, the Individual Emotional Feature Distribution Difference(IEFDD) was found, which was also considered as the main factor of the stability for emotion recognition. After analyzing the limitations of traditional modeling approach suffering from IEFDD, the Weight-based Channel-model Matrix Framework(WCMF) was proposed. To reasonably characterize emotional feature distribution patterns, four weight extraction methods were designed, and the optimal was the correction T-test(CT) weight extraction method. Finally, the performance of WCMF was validated on cross-dataset tasks in two kinds of experiments that simulated different practical scenarios, and the results showed that WCMF had more stable and better emotion recognition ability. Copyright © 2022, The Authors. All rights reserved.

关键词： Emotion Recognition

Cavity-Quantum Electrodynamics with Moiré Flatband Photonic Crystals

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Yu-Tong Ye, Qi-Hang Yan, Jun-Yong Qiao, Yufei Chen, Chen Cheng, Xiao-Tian Li, Chen-Hui Zhang, Zi-Jian Huang, Cheng-Nian Meng, Yun Zou, Kai Zhan, Wen-Kang Zhao, Chao Hu, Xiaolong Tee, Clarence Augustine T.H. Sha, Wei E.I. Huang, Zhixiang Liu, Huiyun Jin, Chao-Yuan Ying, Lei Liu, Feng State Key Laboratory of Extreme Photonics and Instrumentation College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China School of Physics Zhejiang Key Laboratory of Micro-nano Quantum Chips and Quantum Control Zhejiang University Hangzhou310027 China School of Precision Instrument and Optoelectronic Engineering Tianjin University Tianjin300072 China Key Laboratory of Optoelectronic Information Science and Technology Ministry of Education Tianjin300072 China Laboratory of Solid State Optoelectronics Information Technology Institute of Semiconductors Chinese Academy of Sciences Beijing100083 China College of Materials Science and Opto-Electronic Technology University of Chinese Academy of Science Beijing101804 China College of Physics and Electrical Information Engineering Zhejiang Normal University Hangzhou310058 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230039 China Department of Electronic and Electrical Engineering University College London LondonWC1E 7JE United Kingdom International Joint Innovation Center Zhejiang University Haining314400 China

Quantum emitters are a key component in photonic quantum technologies. Enhancing their single-photon emission by engineering the photonic environment using cavities can improve the overall efficiency in quantum information processing. However, this enhancement is often limited by the need for precise nanoscale control over emitter’s position within micro/nano-cavities. Inspired by the fascinated physics of moiré pattern, we present an approach to strongly modify the spontaneous emission rate of a quantum emitter using fine-designed multilayer moiré photonic crystal with a robust isolate-flatband dispersion. Theoretical analysis reveals that due to its nearly infinite photonic density of states, the moiré cavity can simultaneously possess high Purcell factor and large tolerance over emitter’s position. We experimentally demonstrate the coupling between this moiré cavity and a quantum dot via the cavity-determined polarization of the dot’s emission. The radiative lifetime of the quantum dot can be tuned by a factor of 40 from 42 ps to 1692 ps, attributed to strong Purcell enhancement and Purcell inhibition effects. Our findings pave the way for moiré flatband cavity-enhanced quantum light sources, quantum optical switches and quantum nodes for quantum internet. Copyright © 2024, The Authors. All rights reserved.

关键词： Particle beams

Data-deficiency-tolerated method for viewpoint independent sign language recognition

学校读者我要写书评

暂无评论

Jisuanji Xuebao/Chinese Journal of Computers 2009年第5期32卷 953-961页

作者： Wang, Qi Chen, Xi-Lin Wang, Chun-Li Gao, Wen School of Computer Science and Technology Harbin Institute of Technology Harbin 150001 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Information Science and Technology Dalian Maritime University Dalian 116026 China School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

This paper proposes a Sample-Consensus method for viewpoint independent sign language recognition under data deficiency (matched features are possibly deficient with regard to some frame pairs). The proposed method is based on the epipolar geometry and inspired by RANSAC. The basic idea is that all corresponded frames between two sequences of the same sign can be roughly considered as captured synchronously by a virtual stereo vision system and thus they will satisfy the same fundamental matrix. In addition, the fundamental matrix can be estimated from point correspondences contained by some part of corresponding frames. Experimental results demonstrate the efficiency of the proposed method. Moreover, this Sample-Consensus method can be easily extended to some similar problems, such as viewpoint independent activity analysis and rigid-motion analysis.

关键词： Stereo image processing

Forecasting wheat aphid with remote sensing based on relevance vector machine

学校读者我要写书评

暂无评论

Nongye Gongcheng Xuebao/Transactions of the Chinese Society of Agricultural Engineering 2015年第6期31卷 201-207页

作者： Tang, Cuicui Huang, Wenjiang Luo, Juhua Liang, Dong Zhao, Jinling Huang, Linsheng Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei230039 China School of Electronic and Information Engineering Anhui University Hefei230039 China Key Laboratory of Digital Earth Science Institute of Remote Sensing and Digital Earth Chinese Academy of Sciences Beijing100094 China Nanjing Institute of Geography and Limnology Chinese Academy of Sciences Nanjing210008 China

The prevalence of aphid in winter wheat field has a significant impact on the production of winter wheat. An effective and timely forewarning of the scope and severity of the disease at a regional scale will not only reduce yield losses but also alert the stakeholders to take effective preventive measures. Forecasting aphid occurrence with Remote Sensing has great advantages over traditional methods and meteorological data, such as lower cost, simpler operation, more real-time and higher resolution. Chinese HJ-1A/1B data which have a high revisit frequency ( ©, 2015, Chinese Society of Agricultural Engineering. All right reserved.

关键词： Satellite imagery

Improved Diversity-Promoting Collaborative Metric Learning for Recommendation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Bao, Shilong Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China The Security Department of Alibaba Group Hangzhou311121 China School of Cyber Science and Technology Shenzhen Campus of Sun Yat-sen University Shenzhen518107 China University of Chinese Academy of Sciences Beijing101408 China Peng Cheng Laboratory Shenzhen518055 China

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and collaborative filtering. Following the convention of RS, existing practices exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to introduce a set of multiple representations for each user in the system where users' preference toward an item is aggregated by taking the minimum item-user distance among their embedding set. Specifically, we instantiate two effective assignment strategies to explore a proper quantity of vectors for each user. Meanwhile, a Diversity Control Regularization Scheme (DCRS) is developed to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could induce a smaller generalization error than traditional CML. Furthermore, we notice that CML-based approaches usually require negative sampling to reduce the heavy computational burden caused by the pairwise objective therein. In this paper, we reveal the fundamental limitation of the widely adopted hard-aware sampling from the One-Way Partial AUC (OPAUC) perspective and then develop an effective sampling alternative for the CML-based paradigm. Finally, comprehensive experiments over a range of benchmark datasets speak to the efficacy of DPCML. Code are available at https://***/statusrank/LibCML. © 2024, CC BY-NC-SA.

关键词： Adversarial machine learning

Deep learning based joint resource scheduling algorithms for hybrid MEC networks

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Jiang, Feibo Wang, Kezhi Dong, Li Pan, Cunhua Xu, Wei Yang, Kun Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Department of Computer and Information Sciences Northumbria University United Kingdom Key Laboratory of Hunan Province for New Retail Virtual Reality Technology Hunan University of Technology and Business Changsha China School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom NCRL Southeast University Nanjing China School of Computer Technology and Engineering Changchun Institute of Technology Changchun China School of Computer Sciences and Electrical Engineering University of Essex ColchesterCO4 3SQ United Kingdom

In this paper, we consider a hybrid mobile edge computing (H-MEC) platform, which includes ground stations (GSs), ground vehicles (GVs) and unmanned aerial vehicle (UAVs), all with mobile edge cloud installed to enable user equipments (UEs) or Internet of thing (IoT) devices with intensive computing tasks to offload. Our objective is to obtain an online offloading algorithm to minimize the energy consumption of all the UEs, by jointly optimizing the positions of GVs and UAVs, user association and resource allocation in real-time, while considering the dynamic environment. To this end, we propose a hybrid deep learning based online offloading (H2O) framework where a large-scale path-loss fuzzy c-means (LSFCM) algorithm is first proposed and used to predict the optimal positions of GVs and UAVs. Secondly, a fuzzy membership matrix U-based particle swarm optimization (U-PSO) algorithm is applied to solve the mixed integer nonlinear programming (MINLP) problems and generate the sample datasets for the deep neural network (DNN) where the fuzzy membership matrix can capture the small-scale fading effects and the information of mutual interference. Thirdly, a DNN with the scheduling layer is introduced to provide user association and computing resource allocation under the practical latency requirement of the tasks and limited available computing resource of H-MEC. In addition, different from traditional DNN predictor, we only input one UEs information to the DNN at one time, which will be suitable for the scenarios where the number of UE is varying and avoid the curse of dimensionality in DNN. Copyright © 2019, The Authors. All rights reserved.

关键词： Deep neural networks

Optimizing Partial Area Under the Top-k Curve: Theory and Practice

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wang, Zitai Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Security Department Alibaba Group Hangzhou311121 China School of Cyber Science and Technology Sun Yat-Sen University Shenzhen Campus Shenzhen518107 China University of Chinese Academy of Sciences Beijing101408 China Peng Cheng Laboratory Shenzhen518055 China

Top-k error has become a popular metric for large-scale classification benchmarks due to the inevitable semantic ambiguity among classes. Existing literature on top-k optimization generally focuses on the optimization method of the top-k objective, while ignoring the limitations of the metric itself. In this paper, we point out that the top-k objective lacks enough discrimination such that the induced predictions may give a totally irrelevant label a top rank. To fix this issue, we develop a novel metric named partial Area Under the top-k Curve (AUTKC). Theoretical analysis shows that AUTKC has a better discrimination ability, and its Bayes optimal score function could give a correct top-K ranking with respect to the conditional probability. This shows that AUTKC does not allow irrelevant labels to appear in the top list. Furthermore, we present an empirical surrogate risk minimization framework to optimize the proposed metric. Theoretically, we present (1) a sufficient condition for Fisher consistency of the Bayes optimal score function;(2) a generalization upper bound which is insensitive to the number of classes under a simple hyperparameter setting. Finally, the experimental results on four benchmark datasets validate the effectiveness of our proposed framework. © 2022, CC BY.

关键词： Machine learning

A Learning Convolutional Neural Network Approach for Network Robustness Prediction

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Lou, Yang Wu, Ruizi Li, Junli Wang, Lin Li, Xiang Chen, Guanrong The Department of Computing and Decision Sciences Lingnan University Hong Kong The Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China The College of Computer Science Sichuan Normal University Chengdu610066 China The Department of Automation Shanghai Jiao Tong University Shanghai200240 China The Institute of Complex Networks and Intelligent Systems Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai201210 China The Department of Control Science and Engineering Tongji University Shanghai200240 China The Department of Electrical Engineering City University of Hong Kong Hong Kong

Network robustness is critical for various societal and industrial networks again malicious attacks. In particular, connectivity robustness and controllability robustness reflect how well a networked system can maintain its connectedness and controllability against destructive attacks, which can be quantified by a sequence of values that record the remaining connectivity and controllability of the network after a sequence of node- or edge-removal attacks. Traditionally, robustness is determined by attack simulations, which are computationally very time-consuming or even practically infeasible. In this paper, an improved method for network robustness prediction is developed based on learning feature representation using convolutional neural network (LFR-CNN). In this scheme, higher-dimensional network data are compressed to lower-dimensional representations, and then passed to a CNN to perform robustness prediction. Extensive experimental studies on both synthetic and real-world networks, both directed and undirected, demonstrate that 1) the proposed LFR-CNN performs better than other two state-of-the-art prediction methods, with significantly lower prediction errors;2) LFR-CNN is insensitive to the variation of the network size, which significantly extends its applicability;3) although LFR-CNN needs more time to perform feature learning, it can achieve accurate prediction faster than attack simulations;4) LFR-CNN not only can accurately predict network robustness, but also provides a good indicator for connectivity robustness, better than the classical spectral measures. © 2022, CC BY.

关键词： Complex networks