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

arXiv 2024年

作者： Ikeda, Shunnosuke Nishimura, Naoki Sukegawa, Noriyoshi Takano, Yuichi Product Development Management Office Data Management & Planning Office Recruit Co. Ltd. 1–9–2 Chiyoda–ku Tokyo100–6640 Japan Department of Advanced Sciences Hosei University 3–7–2 Kajinocho Koganei–shi Tokyo184–8584 Japan Graduate School of Science and Technology University of Tsukuba 1–1–1 Tennodai Tsukuba–shi Ibaraki305–8573 Japan Institute of Systems and Information Engineering University of Tsukuba 1–1–1 Tennodai Tsukuba–shi Ibaraki305–8573 Japan

This paper is concerned with personalized pricing models aimed at maximizing the expected revenues or profits for a single item. While it is essential for personalized pricing to predict the purchase probabilities for each consumer, these predicted values are inherently subject to unavoidable errors that can negatively impact the realized revenues and profits. To address this issue, we focus on robust optimization techniques that yield reliable solutions to optimization problems under uncertainty. Specifically, we propose a robust optimization model for personalized pricing that accounts for the uncertainty of predicted purchase probabilities. This model can be formulated as a mixed-integer linear optimization problem, which can be solved exactly using mathematical optimization solvers. We also develop a Lagrangian decomposition algorithm combined with line search to efficiently find high-quality solutions for large-scale optimization problems. Experimental results demonstrate the effectiveness of our robust optimization model and highlight the utility of our Lagrangian decomposition algorithm in terms of both computational efficiency and solution quality. Copyright © 2024, The Authors. All rights reserved.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

An improved entropy function for the intuitionistic fuzzy sets with application to cloud vendor selection

引用

Decision Analytics Journal 2023年 7卷

作者： Krishankumar, Raghunathan Ravichandran, K.S. Aggarwal, Manish Pamucar, Dragan Information Technology Systems and Analytics Area Indian Institute of Management Bodh Gaya Bihar Bodh Gaya 824234 India Department of Mathematics Amrita School of Physical Sciences Coimbatore Amrita Vishwa Vidyapeetham India School of Artificial Intelligence and Data Science IIT Jodhpur Jodhpur India Digital Humanties IIT Jodhpur Jodhpur India Faculty of Organizational Sciences University of Belgrade Serbia College of Engineering Yuan Ze University Taiwan

This study proposes a novel entropy function for the intuitionistic fuzzy sets to improve the existing fuzzy entropy measure. We introduce an attitude-based entropy measure by methodically calculating the experts’ attitude values through variance approach. We discuss several important properties and present an example to demonstrate the applicability and efficacy of the proposed method. An illustrative example exhibits the effectiveness of the proposed intuitionistic fuzzy entropy functions and measures. We further show the superiority of the proposed intuitionistic fuzzy entropy measures over the existing measures. © 2023 The Author(s)

关键词： Aggarwal entropy Cloud vendor selection Decision-making Intuitionistic fuzzy sets Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Online Attentive Kernel-Based Temporal Difference Learning

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

DeepKAF: A Heterogeneous CBR Deep Learning Approach for NLP Prototyping

DeepKAF: A Heterogeneous CBR Deep Learning Approach for NLP ...

引用

2020 International Conference on INnovations in Intelligent systems and Applications, INISTA 2020

作者： Amin, Kareem Kapetanakis, Stelios Polatidis, Nikolaos Althoff, Klaus-Dieter Dengel, Andreas Smart Data and Knowledge Services German Research Center for Artificial Intelligence Technische Universität Kaiserslautern Kaiserslautern Germany School of Computing Engineering and Mathematics University of Brighton Brighton United Kingdom Intelligent Information Systems Lab Institute of Computer Science University of Hildesheim Hildesheim Germany

ISBN: (纸本)9781728167992

With widespread modernization, digitization and transformations of most of industries, Artificial Intelligence (AI) has become the key enabler in that modernization journey. AI offers substantial capabilities to solve new problems and optimise existing solutions specialising on specific problems and learning from different domains. AI solutions can be either explainable or black box ones with the latter being urged to improve since they cannot trust. Case-based Reasoning (CBR) is an explainable AI approach where solutions are provided along with relevant explanations in terms of why a solution was selected. However, CBR, like most other explainable approaches, has several limitations in terms of scalability, large data volumes, domain complexity, that reduce its ability to scale any CBR system in industrial applications. In this paper, we provide a heterogeneous CBR framework - DeepKAF where we combine CBR paradigm with Deep Learning architectures to solve complicated Natural Language Processing (NLP) problems (eg. mixed language and grammatically incorrect text).DeepKAF is built based on continuous research in the area of Deep Learning and CBR. DeepKAF has been implemented and used across different domains, test use cases and research models as an ensemble deep learning and CBR Architecture. © 2020 IEEE.

关键词： Case based reasoning

来源：评论

学校读者我要写书评

暂无评论

Who knows more? The role of structural hole spanners in accurate information identification on social media

引用

Pacific Basin Finance Journal 2025年 93卷

作者： Guo, Man Long, Wen Zhong, Yanqiang Zhang, Wei School of Economics and Management University of Chinese Academy of Sciences Beijing 100190 China Research Center on Fictitious Economy & Data Science Chinese Academy of Sciences Beijing 100190 China Key Laboratory of Big Data Mining & Knowledge Management Chinese Academy of Sciences Beijing 100190 China Department of Information Systems and Management Engineering Southern University of Science and Technology Shenzhen 518055 China

Based on structural hole theory, this study explores the differences in the ability of Chinese social media users with different characteristics to provide accurate information. Using over 20 million interactive data from 2.19 million users, we construct a social network and identify structural hole spanners and ordinary users. As key players in a network, structural hole spanners are typically located at the intersections of different groups or information sources. They differ from ordinary users in the way they gather and disseminate information. The empirical results indicate that the accuracy of market judgements by structural hole spanners is at least 12.38 % higher than that of ordinary users. Strategy simulations show that using information from structural hole spanners to make investment decisions can achieve a 116 % cumulative return during the backtesting period, nearly four times that of ordinary users. This information advantage occurs primarily because opinion distance and information uniqueness play significant roles in improving information accuracy. This study not only helps deepen understanding of information dissemination characteristics among heterogeneous users on social media but also provides empirical support for the application of structural hole theory in finance, with important theoretical and practical implications. © 2024

关键词： Accurate information Social media Stock market Structural hole spanners

来源：评论

学校读者我要写书评

暂无评论

Anomaly detection on attributed networks via contrastive self-supervised learning

arXiv

引用

arXiv 2021年

作者： Liu, Yixin Li, Zhao Pan, Shirui Gong, Chen Zhou, Chuan Karypis, George The Department of Data Science and AI Faculty of Information Technology Monash University ClaytonVIC3800 Australia The Alibaba Group Hangzhou310000 China The PCA Laboratory Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China The Department of Computing The Hong Kong Polytechnic University Hong Kong The Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100093 China The Department of Computer Science and Engineering University of Minnesota MinneapolisMN55455 United States

Anomaly detection on attributed networks attracts considerable research interests due to wide applications of attributed networks in modeling a wide range of complex systems. Recently, the deep learning-based anomaly detection methods have shown promising results over shallow approaches, especially on networks with high-dimensional attributes and complex structures. However, existing approaches, which employ graph autoencoder as their backbone, do not fully exploit the rich information of the network, resulting in suboptimal performance. Furthermore, these methods do not directly target anomaly detection in their learning objective and fail to scale to large networks due to the full graph training mechanism. To overcome these limitations, in this paper, we present a novel Contrastive self-supervised Learning framework for Anomaly detection on attributed networks (CoLA for abbreviation). Our framework fully exploits the local information from network data by sampling a novel type of contrastive instance pair, which can capture the relationship between each node and its neighboring substructure in an unsupervised way. Meanwhile, a well-designed graph neural network-based contrastive learning model is proposed to learn informative embedding from high-dimensional attributes and local structure and measure the agreement of each instance pairs with its outputted scores. The multi-round predicted scores by the contrastive learning model are further used to evaluate the abnormality of each node with statistical estimation. In this way, the learning model is trained by a specific anomaly detection-aware target. Furthermore, since the input of the graph neural network module is batches of instance pairs instead of the full network, our framework can adapt to large networks flexibly. Experimental results show that our proposed framework outperforms the state-of-the-art baseline methods on all seven benchmark datasets. © 2021, CC BY.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

An Auto-Parallel Method for Deep Learning Models Based on Genetic Algorithm

An Auto-Parallel Method for Deep Learning Models Based on Ge...

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Yan Zeng ChengChuang Huang YiJie Ni ChunBao Zhou JiLin Zhang Jue Wang MingYao Zhou MeiTing Xue YunQuan Zhang School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China Key Laboratory for Modeling and Simulation of Complex Systems Ministry of Education Hangzhou China Data Security Governance Zhejiang Engineering Research Center Hangzhou China School of ITMO Joint Institute Hangzhou Dianzi University Hangzhou China Institute of Computer Network Information Center of the Chinese Academy of Sciences Beijing China HuaWei State Key Laboratory of Computer Architecture Institute of Computing Technology of the Chinese Academy of Sciences Beijing China

As the size of datasets and neural network models increases, automatic parallelization methods for models have become a research hotspot in recent years. The existing auto-parallel methods based on machine learning or graph algorithms still have issues with search efficiency and applicability. This paper proposes an automatic parallel method based on a dual-population genetic algorithm, TGA, which transforms model partitioning and placement into an integer linear programming problem and constructs a cost model to evaluate the solution. The solution space is built using the neural network’s dataflow graph and device cluster’s topology, and the dual-population genetic algorithm is used to search for the optimal model parallel strategy. Experiments with various models show that the proposed method can improve single-step execution time by up to 42% compared to the Baechi method and up to 37.7% compared to the Hierarchical method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

6G-enabled Edge AI for Metaverse: Challenges, Methods, and Future Research Directions

arXiv

引用

arXiv 2022年

作者： Chang, Luyi Zhang, Zhe Li, Pei Xi, Shan Guo, Wei Shen, Yukang Xiong, Zehui Kang, Jiawen Niyato, Dusit Qiao, Xiuquan Wu, Yi School of Data Science and Technology Heilongjiang University Harbin150080 China SenseTime Group Limited Shenzhen518000 China Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore487372 Singapore The School of Automation Guangdong University of Technology China The School of Computer Science and Engineering Nanyang Technological University Singapore Singapore State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China

6G-enabled edge intelligence opens up a new era of Internet of Everything and makes it possible to interconnect people-devices-cloud anytime, anywhere. More and more next-generation wireless network smart service applications are changing our way of life and improving our quality of life. As the hottest new form of next-generation Internet applications, Metaverse is striving to connect billions of users and create a shared world where virtual and reality merge. However, limited by resources, computing power, and sensory devices, Metaverse is still far from realizing its full vision of immersion, materialization, and interoperability. To this end, this survey aims to realize this vision through the organic integration of 6G-enabled edge AI and Metaverse. Specifically, we first introduce three new types of edge-Metaverse architectures that use 6G-enabled edge AI to solve resource and computing constraints in Metaverse. Then we summarize technical challenges that these architectures face in Metaverse and the existing solutions. Furthermore, we explore how the edge-Metaverse architecture technology helps Metaverse to interact and share digital data. Finally, we discuss future research directions to realize the true vision of Metaverse with 6G-enabled edge AI. Copyright © 2022, The Authors. All rights reserved.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Lightweight Task-Oriented Semantic Communication Empowered by Large-Scale AI Models

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Liu, Chuanhong Guo, Caili Yang, Yang Chen, Mingzhe Quek, Tony Q. S. Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing100876 China Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing100876 China University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL United States Singapore University of Technology and Design Dept. of Information Systems Technology and Design 487372 Singapore

Recent studies have focused on leveraging large-scale artificial intelligence (LAI) models to improve semantic representation and compression capabilities. However, the substantial computational demands of LAI models pose significant challenges for real-time communication scenarios. To address this, this paper proposes utilizing knowledge distillation (KD) techniques to extract and condense knowledge from LAI models, effectively reducing model complexity and computation latency. Nevertheless, the inherent complexity of LAI models leads to prolonged inference times during distillation, while their lack of channel awareness compromises the distillation performance. These limitations make standard KD methods unsuitable for task-oriented semantic communication scenarios. To address these issues, we propose a fast distillation method featuring a pre-stored compression mechanism that eliminates the need for repetitive inference, significantly improving efficiency. Furthermore, a channel adaptive module is incorporated to dynamically adjust the transmitted semantic information based on varying channel conditions, enhancing communication reliability and adaptability. In addition, an information bottleneck-based loss function is derived to guide the fast distillation process. Simulation results verify that the proposed scheme outperform baselines in term of task accuracy, model size, computation latency, and training data requirements. © 1967-2012 IEEE.

关键词： NP-hard

来源：评论

学校读者我要写书评

暂无评论

Non-sequential striping encoder from replication to erasure coding for distributed storage system

引用

Frontiers of Computer science 2019年第6期13卷 1356-1358页

作者： Yanwen XIE Dan FENG Fang WANG Lingling ZHANG Wuhan National Laboratory for Optoelectronics School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and TechnologyMinistry of Education of ChinaWuhan 430074China

1 Introduction and main contributions As so many machines are clustered in datacenters,failures occur frequently[1,2].Redundancy schemes,like replication and erasure coding,are deployed to store redundant data to tolerate *** distributed systems with these two redundancy schemes,new data are hot in replication,and usually turn cold as time goes *** encoder performing the conversion can cause large overheads on network and put data in low reliability when the encoder is not well designed.

关键词： strip redundant store

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：