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

data Boundary and data Pricing Based on the Shapley Value

IEEE ACCESS 2022年 10卷 14288-14300页

作者： Tian, Yingjie Ding, Yurong Fu, Saiji Liu, Dalian Univ Chinese Acad Sci Sch Econ & Management Beijing 100190 Peoples R China Chinese Acad Sci Res Ctr Fictitious Econ & Data Sci Beijing 100190 Peoples R China Chinese Acad Sci Key Lab Big Data Min & Knowledge Management Beijing 100190 Peoples R China Beijing Union Univ Inst Math & Phys Beijing 100101 Peoples R China Beijing Union Univ Inst Fundamental & Interdisciplinary Sci Beijing 100101 Peoples R China

data pricing is to price data as asset to promote the healthy development of data share, exchange, and reuse. However, the uncertain value index and neglection of interactivity lead to information asymmetry in the transaction process. A perfect data pricing system and a well-designed data market can widely promote data transactions. We take a three-agent data market in this paper, the data owner who provides the data record, the model buyer who is interested in buying machine learning (ML) model instances, and the broker who interacts between the data owner and the model buyer. Two interaction scenarios are defined. In scenario 1, we introduce the Shapley value (SV) to measure values of data records fairly and construct a revenue optimization problem based on the sum of the SV for data boundary. The optimal solution is obtained by calculating their derivatives. In scenario 2, we utilize market research and construct a revenue maximization (RM) problem to price the ML models. Further, An Integer Linear Programming for the RM problem (RM-ILP) process is proposed to transform the RM problem into an equivalent integer linear programming (ILP) problem and solve it with the Gurobi solver. Finally, we conduct extensive experiments, which validate that the RM-ILP process can provide high revenue to the broker and high affordability to the model buyers compared to the benchmarks.

关键词： Pricing data models Computational modeling Optimization Costs Heuristic algorithms Roads data value data pricing the shapley value model pricing

来源：评论

学校读者我要写书评

暂无评论

Improved incremental local outlier detection for data streams based on the landmark window model

引用

knowledge AND INFORMATION SYSTEMS 2021年第8期63卷 2129-2155页

作者： Li, Aihua Xu, Weijia Liu, Zhidong Shi, Yong Cent Univ Finance & Econ Sch Management Sci & Engn Beijing 102206 Peoples R China Chinese Acad Sci Key Lab Big Data Min & Knowledge Management Beijing 100190 Peoples R China Univ Nebraska Coll Informat Sci & Technol Omaha NE 68182 USA

Most existing algorithms of anomaly detection are suitable for static data where all data are available during detection but are incapable of handling dynamic data streams. In this study, we proposed an improved iLOF (incremental local outlier factor) algorithm based on the landmark window model, which provides an efficient method for anomaly detection in data streams and outperforms conventional methods. What is more, data windows as updating units are introduced to reduce the false alarm rate, and multiple tests are taken here to identify candidate anomalies and real anomalies. The improved iLOF shows its obvious advantage with its false positive rate. Furthermore, the proposed algorithm instantly deletes data points of identified real anomalies. We analyzed the performance of the improved algorithm and the sensitivity of certain parameters via empirical experiments using synthetic and real data sets. The experimental results demonstrate that the proposed improved algorithm achieved better performance on the higher detection rate and the lower false alarm rate compared with the original iLOF algorithm and its improvements.

关键词： Incremental local outlier factor algorithm Landmark window model Anomaly detection data streams

来源：评论

学校读者我要写书评

暂无评论

Graph Influence Network

引用

IEEE TRANSACTIONS ON CYBERNETICS 2023年第10期53卷 6146-6159页

作者： Shi, Yong Quan, Pei Xiao, Yang Lei, Minglong Niu, Lingfeng Univ Chinese Acad Sci Sch Econ & Management Beijing 100190 Peoples R China Chinese Acad Sci Res Ctr Fictitious Econ & Data Sci Beijing 100190 Peoples R China Chinese Acad Sci Key Lab Big Data Min & Knowledge Management Beijing 100190 Peoples R China Univ Nebraska Coll Informat Sci & Technol Omaha NE 68182 USA Univ Chinese Acad Sci Sch Comp Sci & Technol Beijing 100049 Peoples R China Beijing Univ Technol Fac Informat Technol Beijing 100124 Peoples R China Beijing Univ Technol Beijing Inst Artificial Intelligence Beijing Peoples R China

Due to the extraordinary abilities in extracting complex patterns, graph neural networks (GNNs) have demonstrated strong performances and received increasing attention in recent years. Despite their prominent achievements, recent GNNs do not pay enough attention to discriminate nodes when determining the information sources. Some of them select information sources from all or part of neighbors without distinction, and others merely distinguish nodes according to either graph structures or node features. To solve this problem, we propose the concept of the Influence Set and design a novel general GNN framework called the graph influence network (GINN), which discriminates neighbors by evaluating their influences on targets. In GINN, both topological structures and node features of the graph are utilized to find the most influential nodes. More specifically, given a target node, we first construct its influence set from the corresponding neighbors based on the local graph structure. To this aim, the pairwise influence comparison relations are extracted from the paths and a HodgeRank-based algorithm with analytical expression is devised to estimate the neighbors' structure influences. Then, after determining the influence set, the feature influences of nodes in the set are measured by the attention mechanism, and some task-irrelevant ones are further dislodged. Finally, only neighbor nodes that have high accessibility in structure and strong task relevance in features are chosen as the information sources. Extensive experiments on several datasets demonstrate that our model achieves state-of-the-art performances over several baselines and prove the effectiveness of discriminating neighbors in graph representation learning.

关键词： Task analysis Representation learning Graph neural networks Feature extraction data mining Convolution Social networking (online) Graph neural networks (GNNs) graph representation learning HodgeRank influence ranking influence set neighbors discrimination

来源：评论

学校读者我要写书评

暂无评论

A Brief Survey of Distribution Robust Graph Neural Networks

引用

Procedia Computer Science 2024年 242卷 1281-1286页

作者： Lei Zheng Pei Quan Yong Shi Lingfeng Niu The School of Mathematical Sciences University of Chinese Academy of Sciences Beijing 100190 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing 100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing 100190 China The College of Economics and Management Beijing University of Technology Beijing 100124 China The School of Economics and Management University of Chinese Academy of Sciences Beijing 1001090 China

Graph neural network is a powerful tool for solving various graph tasks, such as node classification and graph classification. However, there is increasing evidence suggesting that it is sensitive to distribution shifts and its performance is reduced by at least 10% when distribution shifts happen. In the last three years, to solve the wide existing distribution shifts, some distribution robust strategies have been designed specifically for graph neural networks. It is also one of the popular research topics in graph neural networks in recent years. Therefore, in this paper, we divide these strategies into three categories depending on the specific problems they solve: distribution shift for semi-supervised node classification, distribution shift for unsupervised node classification, and out-of-distribution shift for graph classification. Furthermore, we discuss and summarize the strategies for each type of problem. After investigating these strategies, we put forward future development direction.

关键词： Graph neural networks Shift robust Distribution generalization

来源：评论

学校读者我要写书评

暂无评论

Analysis on the Transmission of International Oil Price to China's Price Index--Based on Granger Causality Network 8

Analysis on the Transmission of International Oil Price to C...

引用

8th International Conference on Information Technology and Quantitative management (ITQM) - Developing Global Digital Economy after COVID-19

作者： Wang, Yijing Wang, Xiuzhenzi Guo, Kun Univ Chinese Acad Sci Sch Econ & Management Beijing Peoples R China Chinese Acad Sci Res Ctr Fictitious Econ & Data Sci Beijing Peoples R China Chinese Acad Sci Key Lab Big Data Min & Knowledge Management Beijing Peoples R China Chinese Acad Sci Acad Math & Syst Sci Beijing Peoples R China

This paper uses complex network theory and Granger causality method to construct Granger Causality Network among price indices (PIGCN), specifically based on crude oil price and China's domestic price index from a systematic perspective and provides a statistical physical method to analyze conduction fluctuations. This paper selects four typical price indices in China, including 36 sub price indices as samples for empirical research. Through the analysis of the PIGCN structure, we have analyzed the volatility transmission path of the international crude oil price and Chinese domestic price index, and further revealed the dynamic relationship among the price indices. Also, we have put forward some policy recommendations to better monitor the spread of price fluctuation risks. (C) 2021 The Authors. Published by Elsevier B.V.

关键词： Granger causality network Price transmission International crude oil price Price indices

来源：评论

学校读者我要写书评

暂无评论

A Study on The Multi-Attribute Decision Theory and Methods 9th

A Study on The Multi-Attribute Decision Theory and Methods

引用

9th International Conference on Information Technology and Quantitative management, ITQM 2022

作者： Feng, Jinyuan Yan, Yunxi Huang, Manling Du, Yang Lu, Zhichen Li, Biao School of Business Administration Faculty of Business Administration Southwestern University of Finance and Economics Chengdu611130 China College of Dance Minzu University of China Beijing China School of Economics and Management University of Chinese Academy of Sciences Beijing101408 China Research Center on Fictitious Economy and Data Science Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China

Multi-attribute decision-making problem (MADM) is a kind of multi-criteria decision-making (MCDM), which is often used to solve decision-making problems where the decision variables are discrete and the number of decision-making schemes is limited. This paper reviews the basic definition of multi-attribute decision making (MADM) through the performance evaluation of science and technology funds in a city, and then deduces the TODIM decision making method and TOPSIS decision making method in detail. Finally, the clue case is decided by combining these two decision making methods. This paper specifically shows the usage scenarios and limitations of the TODIM decision method and the TOPSIS decision method through the clue case, analyzes the advantages and disadvantages of the two methods through the comparison of the two methods, and puts forward suggestions for the clue case based on the results of the two schemes. © 2022 The Authors. Published by Elsevier B.V.

关键词： Decision theory

来源：评论

学校读者我要写书评

暂无评论

Graph Neural Networks with Learnable and Optimal Polynomial Bases

arXiv

引用

arXiv 2023年

作者： Guo, Yuhe Wei, Zhewei Gaoling School of Articial Intelligence Renmin University of China China Peng Cheng Laboratory China Beijing Key Laboratory of Big Data Management and Analysis Methods China MOE Key Lab of Data Engineering and Knowledge Engineering China

Polynomial filters, a kind of Graph Neural Networks, typically use a predetermined polynomial basis and learn the coefficients from the training data. It has been observed that the effectiveness of the model is highly dependent on the property of the polynomial basis. Consequently, two natural and fundamental questions arise: Can we learn a suitable polynomial basis from the training data? Can we determine the optimal polynomial basis for a given graph and node features? In this paper, we propose two spectral GNN models that provide positive answers to the questions posed above. First, inspired by Favard’s Theorem, we propose the FavardGNN model, which learns a polynomial basis from the space of all possible orthonormal bases. Second, we examine the supposedly unsolvable definition of optimal polynomial basis from Wang & Zhang (2022) and propose a simple model, OptBasisGNN, which computes the optimal basis for a given graph structure and graph signal. Extensive experiments are conducted to demonstrate the effectiveness of our proposed models. Our code is available at https://***/yuziGuo/FarOptBasis. © 2023, CC BY.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Topic Selection Model Based on Network Group Intelligence 9th

Topic Selection Model Based on Network Group Intelligence

引用

9th International Conference on Information Technology and Quantitative management, ITQM 2022

作者： Zhang, Lingling Xue, Bowen Huang, Siting School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China Moe Social Science Laboratory of Digital Economic Forecasts and Policy Simulation at Ucas Beijing100190 China Ping An Securities Group Limited Shenzheng518000 China

关键词： Collective Intelligence Consensus Analysis Social Network Topic Selection User influence

来源：评论

学校读者我要写书评

暂无评论

When liver disease diagnosis encounters deep learning:Analysis,challenges,and prospects

引用

iLIVER 2023年第1期2卷 73-87页

作者： Yingjie Tian Minghao Liu Yu Sun Saiji Fu School of Economics and Management University of Chinese Academy of SciencesBeijing 100190China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing 100049China Research Center on Fictitious Economy and Data Science Chinese Academy of SciencesBeijing 100190China Key Laboratory of Big Data Mining and Knowledge Management University of Chinese Academy of SciencesBeijing 100190China MOE Social Science Laboratory of Digital Economic Forecasts and Policy Simulation at UCAS Beijing 100190China Tsinghua University Press Beijing 102611China School of Economics and Management Beijing University of Posts and TelecommunicationsBeijing 100876China

The liver is the second-largest organ in the human body and is essential for digesting food and removing toxic ***,obesity,alcohol use,and other factors can damage the liver and cause liver *** diagnosis of liver disease used to depend on the clinical experience of doctors,which made it subjective,difficult,and *** learning has made breakthroughs in various fields;thus,there is a growing interest in using deep learning methods to solve problems in liver research to assist doctors in diagnosis and *** this paper,we provide an overview of deep learning in liver research using 139 papers from the last 5 *** also show the relationship between data modalities,liver topics,and applications in liver research using Sankey diagrams and summarize the deep learning methods used for each liver topic,in addition to the relations and trends between these ***,we discuss the challenges of and expectations for deep learning in liver research.

关键词： Liver Deep learning data modality Liver topic Application

来源：评论

学校读者我要写书评

暂无评论

Iterative Privileged Learning for Multi-view Classification 10

Iterative Privileged Learning for Multi-view Classification

引用

10th International Conference on Information Technology and Quantitative management, ITQM 2023

作者： Fu, Saiji Tian, Yingjie Tang, Jingjing School of Economics and Management Beijing University of Posts and Telecommunications Beijing100876 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China MOE Social Science Laboratory of Digital Economic Forecasts and Policy Simulation UCAS Beijing100190 China School of Business Administration Faculty of Business Administration Southwestern University of Finance and Economics Sichuan 611130 China

Multi-view data is closely associated with privileged information, presenting opportunities for advancements in current studies. Firstly, they often overlook the dynamic nature of privileged information;Secondly, the current state-of-the-art privileged support vector machine, dSVM+, is primarily designed for single-view learning;Thirdly, some methods only address two-view classification problems;Finally, the performance enhancements achieved by these approaches remain unsatisfactory. To this end, this paper proposes a multi-view privileged support vector machine called MVdSVM+. The iterative learning strategy is put forward to update the privileged information dynamically. To our best knowledge, this is the first attempt of dSVM+ in multi-view learning. Meanwhile, it is designed for multiple views. Experiments show the effectiveness of MVdSVM+ over the benchmark methods. © 2023 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (https://***/licenses/by-nc-nd/4.0) Peer-review under responsibility of the scientific committee of the Tenth International Conference on Information Technology and Quantitative management.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：