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

iSplit LBI: Individualized partial ranking with ties via split LBI

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Xu, Qianqian Sun, Xinwei Yang, Zhiyong Cao, Xiaochun Huang, Qingming Yao, Yuan Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Microsoft Research Asia State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Tech. University of Chinese Academy of Sciences Key Laboratory of Big Data Mining and Knowledge Management CAS Peng Cheng Laboratory Department of Mathematics Hong Kong University of Science and Technology Hong Kong

Due to the inherent uncertainty of data, the problem of predicting partial ranking from pairwise comparison data with ties has attracted increasing interest in recent years. However, in real-world scenarios, different individuals often hold distinct preferences. It might be misleading to merely look at a global partial ranking while ignoring personal diversity. In this paper, instead of learning a global ranking which is agreed with the consensus, we pursue the tie-aware partial ranking from an individualized perspective. Particularly, we formulate a unified framework which not only can be used for individualized partial ranking prediction, but also be helpful for abnormal user selection. This is realized by a variable splitting-based algorithm called iSplitLBI. Specifically, our algorithm generates a sequence of estimations with a regularization path, where both the hyperparameters and model parameters are updated. At each step of the path, the parameters can be decomposed into three orthogonal parts, namely, abnormal signals, personalized signals and random noise. The abnormal signals can serve the purpose of abnormal user selection, while the abnormal signals and personalized signals together are mainly responsible for individual partial ranking prediction. Extensive experiments on simulated and real-world datasets demonstrate that our new approach significantly outperforms state-of-the-art alternatives. The code is now availiable at https://***/qianqianxu010/ NeurIPS2019-iSplitLBI. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

Synergies quantification and evolution on air pollutant and CO2 emissions driven by different socio-economic effects

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Fan, Yu Jing, Siyu Zhan, Min Zhang, Jian School of Economics and Management Beijing Information Science and Technology University Beijing100192 China Beijing Key Laboratory of Big Data Decision Making for Green Development Beijing100192 China School of Digital Media Engineering and Humanities Hunan University of Technology and Business Changsha410205 China Xiangjiang Laboratory School of Business Central South University Changsha410083 China Beijing International Science and Technology Cooperation Base for Intelligent Decision and Big Data Application Beijing100192 China

Realizing a synergistic reduction of air pollutant and CO2 emissions (APCE) is an important approach to promote a green socio-economic transformation in China, and it can provide a solid foundation for the achievement of clean energy production and climate action under a sustainable development goal framework. The objective of this study is to explore the quantitative relationship and evolution of synergies between APCE in industrial sectors driven by different socio-economic effects from 2007 to 2020 in China. The results show the main sectors of pollutant emissions had consistency, however, large differences in the reduction efficiency of emissions exist among pollutants. The efficiency in reducing CO2 emissions was about 48% lower when compared with reductions of SO2 (95%), NOX (86%), and smoke and dust (83%) emissions from 2007 to 2020. The effects of improved technology were the main contributor to a reduction in pollutant emissions, but the synergies between APCE driving by it were not achieved. While the synergies between APCE driven by structure and final demand effects were significant. The synergies between NOX and CO2 emissions were stronger driven by final effects structure and types, with correlation coefficients of 1.06 and 1.13, respectively. Besides, the degree of synergistic reduction between APCE in most industrial sectors was around zero. Therefore, the efficiency of synergistic pollution reduction should be improved with the development of a synergistic governance system for industrial sectors. © 2024, The Authors. All rights reserved.

关键词： Economic and social effects

New entanglement-assisted quantum codes from negacyclic codes

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Chen, Xiaojing Lu, Xingbo Zhu, Shixin Jiang, Wan Wang, Xindi School of Internet Anhui University Anhui Hefei230039 China School of Mathematics Hefei University of Technology Anhui Hefei230601 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Anhui Hefei230601 China School of Computer and Information Hefei University of Technology Anhui Hefei230601 China

The theory of entanglement-assisted quantum error-correcting codes (EAQECCs) is a generalization of the standard stabilizer quantum error-correcting codes, which can be possibly constructed from any classical codes by relaxing the duality condition and utilizing preshared entanglement between the sender and receiver. In this paper, a new family of EAQECCs is constructed from negacyclic codes of length n = q2a+1, where q is an odd prime power, a = m22+1 and m is an odd integer. Some new entanglement-assisted quantum maximum distance separable (EAQMDS) codes are obtained in the sense that their parameters are not covered by the previously known ones. Copyright © 2023, The Authors. All rights reserved.

关键词： Quantum entanglement

Human-in-The-Loop Optimization for Vehicle Body Lightweight Design

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Hao, Jia Deng, Ruofan Jia, Liangyue Li, Zuoxuan Alizadeh, Reza Soltanisehat, Leili Liu, Binyi Sun, Zhibin Shao, Yiping Industrial and Systems Engineering Laboratory Beijing Institute of Technology Beijing100081 China Yangtze Delta Region Academy Beijing Institute of Technology Jiaxing314019 China Key Laboratory of Industry Knowledge & Data Fusion Technology and Application Ministry of Industry and Information Technology Beijing Institute of Technology Beijing100081 China School of Industrial and Systems Engineering University of Oklahoma NormanOK United States Charlton College of Business University of Massachusetts- Dartmouth MA United States College of Mechanical Engineering Zhejiang University of Technology Hangzhou310023 China

Automatic optimization algorithms are crucial for vehicle body lightweight design;however, existing methods remain inefficient leading to excessive iterations that increase both time and costs. Current interactive optimization strategies partially mitigate this issue but lack a broad range of manipulation points and auxiliary information models. As such, we introduce a novel approach, "Human-in-the-Loop based method for Vehicle Body Lightweight Design" (HIL-VBLD). This method integrates human decision-making with optimization algorithms to reduce unproductive iterations. HIL-VBLD comprises two key components: (1) an innovative interaction mode that provides multiple manipulation points including constraint modification, algorithm switching, and selection of solutions of interest (SOI);(2) A comprehensive auxiliary information model that supports decision-making for designers. Our analysis demonstrates HIL-VBLD's efficacy, showing a 54.5% reduction in iteration cycles for genetic algorithm using SOI selection. Algorithm switching led to a 4.5% mass reduction, avoiding local optimum pitfalls associated with gradient algorithms. Additionally, the auxiliary information model achieved a further 1.25% mass reduction, enhancing optimization robustness. Compared to conventional automatic algorithm switching strategies, HIL-VBLD maintains equivalent accuracy with 23.9% fewer iterations. © 2024, The Authors. All rights reserved.

关键词： Genetic algorithms

A review on vision-based analysis for automatic dietary assessment

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wang, Wei Min, Weiqing Li, Tianhao Dong, Xiaoxiao Li, Haisheng Jiang, Shuqiang School of Computer and Engineering Beijing Technology and Business University Beijing100048 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Beijing Key Laboratory of Big Data Technology for Food Safety Beijing100048 China National Engineering Laboratory for Agri-product Quality Traceability Beijing100048 China University of Chinese Academy of Sciences Beijing100049 China

Background: Maintaining a healthy diet is vital to avoid health-related issues, e.g., undernutrition, obesity and many non-communicable diseases. An indispensable part of the health diet is dietary assessment. Traditional manual recording methods are not only burdensome but timeconsuming, and contain substantial biases and errors. Recent advances in Artificial Intelligence (AI), especially computer vision technologies, have made it possible to develop automatic dietary assessment solutions, which are more convenient, less time-consuming and even more accurate to monitor daily food intake. Scope and approach: This review presents Vision-Based Dietary Assessment (VBDA) architectures, including multi-stage architecture and end-to-end one. The multi-stage dietary assessment generally consists of three stages: food image analysis, volume estimation and nutrient derivation. The prosperity of deep learning makes VBDA gradually move to an end-to-end implementation, which applies food images to a single network to directly estimate the nutrition. The recently proposed end-to-end methods are also discussed. We further analyze existing dietary assessment datasets, indicating that one large-scale benchmark is urgently needed, and finally highlight critical challenges and future trends for VBDA. key findings and conclusions: After thorough exploration, we find that multi-task end-to-end deep learning approaches are one important trend of VBDA. Despite considerable research progress, many challenges remain for VBDA due to the meal complexity. We also provide the latest ideas for future development of VBDA, e.g., fine-grained food analysis and accurate volume estimation. This review aims to encourage researchers to propose more practical solutions for VBDA. Copyright © 2021, The Authors. All rights reserved.

关键词： Nutrition

Robust Bidirectional Generative Network For Generalized Zero-Shot Learning

学校读者我要写书评

暂无评论

Robust Bidirectional Generative Network For Generalized Zero...

IEEE International Conference on Multimedia and Expo (ICME)

作者： Yun Xing Sheng Huang Luwen Huangfu Feiyu Chen Yongxin Ge Ministry of Education Key Laboratory of Dependable Service Computing in Cyber Physical Society School of Big Data and Software Engineering at Chongqing University Chongqing P.R.China Fowler College of Business at San Diego State University San Diego USA

ISBN: (数字)9781728113319

ISBN: (纸本)9781728113326

In this work, we propose a novel generative approach named Robust Bidirectional Generative Network (RBGN) based on Conditional Generative Adversarial Network (CGAN) for Generalized Zero-shot Learning (GZSL). RBGN employs the adversarial attack to train a more rigorous discriminator, thus enhancing the generalizability and robustness of the feature generator under minimax strategy. Moreover, RBGN decodes the generated visual features back to their semantic representations to further improve the representational ability of generated visual features and alleviate the hubness problem. The experimental results of GZSL on four datasets, i.e. CUB, SUN, AWA1, AWA2, demonstrate that our model achieves competitive performance compared to state-of-the-art approaches and owns better generalizability to the unseen classes over conventional generative GZSL models. Further robustness analysis also validates the strong robustness of our model to the different types of semantic disturbance.

关键词： Semantics Visualization Robustness Generators Training Decoding Gallium nitride

Online Attentive Kernel-Based Temporal Difference Learning

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yang, Guang Chen, Xingguo Yang, Shangdong Wang, Huihui Dong, Shaokang Gao, Yang The the Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications National Engineering Laboratory for Agri-Product Quality Traceability Beijing Technology and Business University China The State Key Laboratory for Novel Software Technology Nanjing University China The PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China

With rising uncertainty in the real world, online Reinforcement Learning (RL) has been receiving increasing attention due to its fast learning capability and improving data efficiency. However, online RL often suffers from complex Value Function Approximation (VFA) and catastrophic interference, creating difficulty for the deep neural network to be applied to an online RL algorithm in a fully online setting. Therefore, a simpler and more adaptive approach is introduced to evaluate value function with the kernel-based model. Sparse representations are superior at handling interference, indicating that competitive sparse representations should be learnable, non-prior, non-truncated and explicit when compared with current sparse representation methods. Moreover, in learning sparse representations, attention mechanisms are utilized to represent the degree of sparsification, and a smooth attentive function is introduced into the kernel-based VFA. In this paper, we propose an Online Attentive Kernel-Based Temporal Difference (OAKTD) algorithm using two-timescale optimization and provide convergence analysis of our proposed algorithm. Experimental evaluations showed that OAKTD outperformed several Online Kernel-based Temporal Difference (OKTD) learning algorithms in addition to the Temporal Difference (TD) learning algorithm with Tile Coding on public Mountain Car, Acrobot, CartPole and Puddle World tasks. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

XCrossNet: Feature structure-oriented learning for click-through rate prediction

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Yu, Runlong Ye, Yuyang Liu, Qi Wang, Zihan Yang, Chunfeng Hu, Yucheng Chen, Enhong Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China Hefei China Management Science and Information Systems Rutgers Business School Rutgers University Newark United States MOE Key Laboratory of Computational Linguistics School of Electronics Engineering and Computer Science Peking University Beijing China Tencent Inc Shenzhen China

Click-Through Rate (CTR) prediction is a core task in nowadays commercial recommender systems. Feature crossing, as the mainline of research on CTR prediction, has shown a promising way to enhance predictive performance. Even though various models are able to learn feature interactions without manual feature engineering, they rarely attempt to individually learn representations for different feature structures. In particular, they mainly focus on the modeling of cross sparse features but neglect to specifically represent cross dense features. Motivated by this, we propose a novel Extreme Cross Network, abbreviated XCrossNet, which aims at learning dense and sparse feature interactions in an explicit manner. XCrossNet as a feature structure-oriented model leads to a more expressive representation and a more precise CTR prediction, which is not only explicit and interpretable, but also time-efficient and easy to implement. Experimental studies on Criteo Kaggle dataset show significant improvement of XCrossNet over state-of-the-art models on both effectiveness and efficiency. © 2021, CC BY.

关键词： Forecasting

Median query research in wireless sensor networks

学校读者我要写书评

暂无评论

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2010年第2A期38卷 133-137页

作者： Wu, Zhong-Bo Zhang, Hui Chen, Hong Information School Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 China School of Mathematics and Computer Science Xiangfan University Xiangfan Hubei 441053 China

Poor quality and harsh condition can result in faulty and outlier data in sampling data of sensor nodes. So we need median query to reflect average level of monitoring region. First, we put forward HMA algorithm. Second, we extend HMA algorithm and put forward HFMA algorithm. In HFMA, We only need collect data inside filter and aggregate influence coefficient during sampling period. Base station can compute median result according to the sample data inside filter and influence coefficient aggregation value. Experimental results have shown that HFMA outperforms Naive algorithm and HMA algorithm and can prolong the lifetime of sensor network.

关键词： Sensor nodes