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

Independent or Social Driven decision? A Counterfactual Refinement Strategy for Graph-Based Social Recommendation

ACM Transactions on Information Systems 2025年第3期43卷

作者： Li, Dongyang Sun, Jianshan Gao, Chongming Feng, Fuli Yuan, Kun School of Management Hefei University of Technology Hefei China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Hefei China University of Science and Technology of China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China University of Science and Technology of China Hefei China Hefei University of Technology Hefei China Key Laboratory of Philosophy and Social Sciences for Cyberspace Behaviour and Management Hefei China

Social recommendation models have traditionally relied on social homophily to enhance user preference prediction by incorporating information from socially connected friends. However, this approach neglects the diverse nature of social relationships. Some individuals with independent personalities often prioritize their own interests over friends’ advice when making purchase decisions. Conversely, those who seek advice from others are more susceptible to social influence. Moreover, the existing methods tend to overlook redundant and noisy social relationships within the network, hindering their ability to achieve accurate recommendations. In response, this article proposes a novel counterfactual method to understand the causal factors driving purchase behaviors, thereby identifying the influence of users’ friends on their purchase decisions. By answering counterfactual questions about the influence of a friend’s purchase behavior on the user’s choices, we develop a causal model to represent social influence in the network. Our proposed refinement strategy, grounded in causal inference, generates counterfactual purchase behavior and guides the refinement of the social graph. Moreover, we present tailored graph refinement methods at various levels, ensuring fine-grained improvements. Experimental results on benchmark data demonstrate that the application of our strategy to different social recommendation models significantly enhances their predictive performance. The source code has been made available on https://***/LDY911/CFRSSR-Code. © 2025 Copyright held by the owner/author(s).

关键词： Sociology

来源：评论

学校读者我要写书评

暂无评论

Multi-view Clustering via Unified Multi-kernel Learning and Matrix Factorization

arXiv

引用

arXiv 2024年

作者： Jia, Chenxing Cai, Mingjie Fujita, Hamido School of Mathematics Hunan University Changsha Hunan410082 China Shenzhen Research Institute Hunan University Guangdong Shenzhen518000 China Hunan Key Laboratory of Intelligent Decision-Making Technology for Emergency Management Hunan University Changsha Hunan410082 China Universiti Teknologi Malaysia Kuala Lumpur54100 Malaysia Riyadh13412 Saudi Arabia Regional Research Center Iwate Prefectural University Iwate0200693 Japan

Multi-view clustering has become increasingly important due to the multi-source character of real-world data. Among existing multi-view clustering methods, multi-kernel clustering and matrix factorization-based multi-view clustering have gained widespread attention as mainstream approaches. However, multi-kernel clustering tends to learn an optimal kernel and then perform eigenvalue decomposition on it, which leads to high computational complexity. Matrix factorization-based multi-view clustering methods impose orthogonal constraints on individual views. This overly emphasizes the accuracy of clustering structures within single views and restricts the learning of individual views. Based on this analysis, we propose a multi-view clustering method that integrates multi-kernel learning with matrix factorization. This approach combines the advantages of both multi-kernel learning and matrix factorization. It removes the orthogonal constraints on individual views and imposes orthogonal constraints on the consensus matrix, resulting in an accurate final clustering structure. Ultimately, the method is unified into a simple form of multi-kernel clustering, but avoids learning an optimal kernel, thus reducing the time complexity. Furthermore, we propose an efficient three-step optimization algorithm to achieve a locally optimal solution. Experiments on widely-used real-world datasets demonstrate the effectiveness of our proposed method. Copyright © 2024, The Authors. All rights reserved.

关键词： Matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Smart surgical telementoring system with patch-to-pixel point tracking method

EngMedicine

引用

EngMedicine 2025年第1期2卷

作者： Yanwei Qu Ling Li Tongtong Li Jieyu Zheng Wentao Tang Xiaojian Li School of Management Hefei University of Technology Hefei 230009 Anhui China Philosophy and Social Sciences Laboratory of Data Science and Smart Society Governance Ministry of Education Hefei 230009 Anhui China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Hefei 230009 Anhui China Hefei Haochuan Information Technology Co. Ltd Hefei 230088 Anhui China Ministry of Education Engineering Research Center for Intelligent Decision-Making Information System Technologies Hefei 230009 Anhui China

The utilization of surgical telementoring has become increasingly prevalent in enhancing the surgical standards of grassroots hospitals in contemporary times. In the traditional framework of surgical telementoring, remote doctors guide grassroots doctors via video and audio communication, which may encounter obstacles such as inadequate information transfer and challenges in accurately pinpointing the surgical site and path. To mitigate these issues, this study introduces an intelligent surgical telementoring system based on edge computing. This system enables the transmission of points marked by remote doctors to grassroots doctors, updating these points’ coordinates in real-time on the local endoscopic video. In this system, a novel method named P2PTracking (Patch-to-Pixel Point Tracking) is implemented. This process begins with the tracking of a square patch surrounding the point marked by the remote doctor using SiameseFC. Following this, feature matching is performed on the tracked patch in the current frame and the square patch in the labelled frame or template frame. The affine transformation is then calculated based on the feature matching results. Lastly, the point tracking result is derived using the computed affine transformation. Experimental results indicate that the proposed system has a transmission speed of 1.99M/s and a transmission latency of 171 ms when transmitting video at a resolution of 1920 × 1080px, while the proposed method can achieve an accuracy of 96.6 % when the pixel error is 4. The code and data are available at https://***/hfut66/*** .

关键词： Surgical telementoring Patch tracking Point tracking Feature matching Template update mechanism

来源：评论

学校读者我要写书评

暂无评论

Optimizing Carbon Emissions in Green Logistics for Time-Dependent Routing

SSRN

引用

SSRN 2024年

作者： Liu, Yiming Yu, Yang Roberto, Baldacci Tang, Jiafu Sun, Wei State Key Laboratory of Synthetic Automation for Process Industries Institute of Intelligent Data and Systems Engineering Northeastern University Shenyang110819 China Dalian University of Technology School of Economics and Management Liaoning Dalian116024 China Division of Engineering Management and Decision Sciences College of Science and Engineering Hamad Bin Khalifa University Qatar Foundation P.O. Box 34110 Doha Qatar College of Management Science and Engineering Dongbei University of Finance and Economics Shahekou Dalian116026 China Business School Liaoning University Shenyang110316 China

This paper considers a green vehicle routing problem termed the time-dependent green vehicle routing problem with time windows (TDGVRPTW). The TDGVRPTW is an extension of the green vehicle routing problem with time windows in green logistics. It considers time-dependent vehicle speed and aims to minimize carbon emissions. Since the travel times and carbon emissions between locations depend on the departure time from the starting location, optimizing carbon emissions requires determining the optimal departure times from both the depot and customers. This paper presents a branch-price-and-cut (BPC) algorithm to solve the TDGVRPTW. The problem is formulated based on a set-partitioning model. To solve the pricing problem associated with the set-partitioning model, we first define backward non-dominated time-dependent arcs and optimal timed routes. We also introduce three types of routes, forward, backward, and patchwork optimal timed routes, and analyze their characteristics. Then, we introduce a method to adjust the times in backward and patchwork optimal timed routes from the latest to the earliest. We prove that this method guarantees correctness and effectively reduces complexity. We propose a bidirectional labeling algorithm to generate routes. The pricing problem employs state-of-the-art techniques, including limited memory subset row cuts (lm-SRCs), ng-route relaxation, and bucket graphs to enhance the algorithm’s efficiency. The BPC algorithm is tested on a set of instances derived from benchmark instances in the literature. The results demonstrate the effectiveness of the proposed algorithm in solving the TDGVRPTW. © 2024, The Authors. All rights reserved.

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

An adaptive bi-objective optimization algorithm for the satellite image data downlink scheduling problem considering request split

arXiv

引用

arXiv 2022年

作者： Chang, Zhongxiang Punnen, Abraham P. Zhou, Zhongbao School of Business Administration Hunan University Changsha410082 China Department of Mathematics Simon Fraser University SurreyBCV3T 0A3 Canada Hunan Key Laboratory of Intelligent Decision-Making Technology for Emergency Management Changsha410082 China

The satellite image data downlink scheduling problem (SIDSP) is well studied in literature for traditional satellites. With recent developments in satellite technology, SIDSP for modern satellites became more complicated, adding new dimensions of complexities and additional opportunities for the effective use of the satellite. In this paper, we introduce the dynamic two-phase satellite image data downlink scheduling problem (D-SIDSP) which combines two interlinked operations of image data segmentation and image data downlink, in a dynamic way, and thereby offering additional modelling flexibility and renewed capabilities. D-SIDSP is formulated as a bi-objective problem of optimizing the image data transmission rate and the service-balance degree. Harnessing the power of an adaptive large neighborhood search algorithm (ALNS) with a nondominated sorting genetic algorithm II (NSGA-II), an adaptive biobjective memetic algorithm, ALNS+NSGA-II, is developed to solve D-SIDSP. Results of extensive computational experiments carried out using benchmark instances are also presented. Our experimental results disclose that the algorithm ALNS+NSGA-II is a viable alternative to solve D-SIDSP more efficiently and demonstrates superior outcomes based on various performance metrics. The paper also offers new benchmark instances for D-SIDSP that can be used in future research works on the topic. © 2022, CC BY-NC-ND.

关键词： Satellites

来源：评论

学校读者我要写书评

暂无评论

Multi-strip observation scheduling problem for active-imaging agile earth observation satellites

arXiv

引用

arXiv 2022年

作者： Chang, Zhongxiang Punnen, Abraham P. Zhou, Zhongbao School of Business Administration Hunan University Changsha410082 China Department of Mathematics Simon Fraser University SurreyBCV3T 0A3 Canada Hunan Key Laboratory of intelligent decision-making technology for emergency management Changsha410082 China

Active-imaging agile earth observation satellite (AI-AEOS) is a new generation agile earth observation satellite (AEOS). With renewed capabilities in observation and active imaging, AI-AEOS improves upon the observation capabilities of AEOS and provide additional ways to observe ground targets. This however makes the observation scheduling problem for these agile earth observation satellite more complex, especially when considering multi-strip ground targets. In this paper, we investigate the multi-strip observation scheduling problem for an active-image agile earth observation satellite (MOSP). A bi-objective optimization model is presented for MOSP along with an adaptive bi-objective memetic algorithm which integrates the combined power of an adaptive large neighborhood search algorithm (ALNS) and a nondominated sorting genetic algorithm II (NSGA-II). Results of extensive computational experiments are presented which disclose that ALNS and NSGA-II when worked in unison produced superior outcomes. Our model is more versatile than existing models and provide enhanced capabilities in applied problem solving. © 2022, CC BY-NC-ND.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

The Influencing Factors of sCER Price Dynamics Under the Clean Development Mechanism: Theory and Econometric Analysis

引用

Journal of Systems Science & Complexity 2018年第5期31卷 1244-1272页

作者： ZHANG Chen WU Yaqi YANG Yu School of Management Hefei University of Technology Hefei 230009 China Key Laboratory of Process Optimization & Intelligent Decision Making of Ministry of Education Hefei 230009 China

In order to explore the factors and their complex mechanism affecting the price dynamics under the clean development mechanism （CDM）, this article employs the secondary Certified Emission Reduction （sCER） carbon price as the study object, and analyzes its influencing factors from aspects of the international carbon-reduction policies, macroeconomic fluctuations, energy and similar carbon products prices. The innovation of this paper lies in： Introducing necessary factor （the developing countries pricing power） and the application of several international representative indicators to un- derline the ＂world＂ nature of CDM; utilizing different econometric models to obtain noteworthy and more robust results. The authors test the theoretical findings with multiple stationary time series from the launch of CDM to present （2008-2016）. The results reveal that sCER price fluctuation shows the characteristic of asymmetry and substantial persistence. There is a strong statistically significant relationship between macroeconomic conditions, coal and oil prices, with the price of sCER. The authors discover that the pricing power of developing countries indeed has a clear but small impact on the sCER price changes, whereas the price elasticity of supply under CDM is so weak. The interaction between EU emission allowances （EUAs） and sCER presents a shift from dependency to substitution.

关键词： Clean development mechanism econometric analysis influencing factors sCER carbonprice.

来源：评论

学校读者我要写书评

暂无评论

Stream Concept-cognitive Computing System for Streaming Data Learning

TechRxiv

引用

TechRxiv 2023年

作者： Mi, Yunlong Liu, Wenqi Shi, Yong The Big Data and Intelligent Decision Making Research Center Central South University Changsha410083 China The Data Science Research Center Kunming University of Science and Technology Kunming650500 China The Faculty of Science Kunming University of Science and Technology Kunming650500 China The School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China The Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China

People can often acquire knowledge dynamically and rapidly from different types of data, yet existing incremental learning algorithms are still computationally time consuming and most of stream learning methods are mainly designed for streaming data while ignoring other types of data. Hence, this paper proposes a novel dynamic concept learning (CL) algorithm by imitating human cognitive learning processes from the perspective of brain logical cognition, which is named stream concept-cognitive computing system (streamC3S). For streamC3S, it mainly consists of three aspects: the concept space, CL process, and model update process. Moreover, considering the concept drift frequently occurs in the streaming data over time, an extended version of streamC3S (namely, streamC3SE) is also proposed in this work. Specifically, we first show the related theories for streamC3S and streamC3SE on the basis of the concept space. Then an overall framework and its corresponding algorithm are shown. Finally, experimental results on various types of datasets, including the standard machine learning datasets, streaming datasets, image datasets, and two traffic data streams, validate the effectiveness of our streamC3S and streamC3SE compared to the state-of-the-art incremental learning and stream learning algorithms. © 2023, CC BY.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Solving Dynamic Satellite Image Data Downlink Scheduling Problem Via an Adaptive Bi-Objective optimization Algorithm

SSRN

引用

SSRN 2022年

作者： Chang, Zhongxiang Punnen, Abraham P. Zhou, Zhongbao Cheng, Shi School of Business Administration Hunan University Changsha410082 China Department of Mathematics Simon Fraser University SurreyBCV3T 0A32 Canada Hunan Key Laboratory of intelligent decision-making technology for emergency management Changsha410082 China School of Computer Science Shaanxi Normal University Xi’an710119 China

The satellite image data downlink scheduling problem (SIDSP) plays a critical role in the mission planning operation of earth observation satellites. However, with recent developments in satellite technology, the traditional SIDSP is poorly effective for modern satellites due to the more complicated and additional opportunities for the satellite. To offer additional modeling flexibility and renewed capabilities, a dynamic satellite image data downlink scheduling problem (DSIDSP) which combines two interlinked operations of image data segmentation and image data downlink dynamically was introduced. The DSIDSP is formulated as a bi-objective problem of optimizing the image data transmission rate and the service-balance degree. Harnessing the power of an adaptive large neighborhood search (ALNS) algorithm with a nondominated sorting genetic algorithm II (NSGA-II), an adaptive bi-objective memetic algorithm, NSGA2ALNS, is developed to solve DSIDSP. Results of extensive computational experiments carried out using benchmark instances are also presented. Our experimental results disclose that the algorithm NSGA2ALNS is a viable alternative to solve DSIDSP more efficiently and demonstrates superior outcomes based on various performance metrics. In addition, new benchmark instances are also provided for DSIDSP that could be used in the future research. © 2022, The Authors. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Solving the Observing and Downloading Integrated Scheduling Problem of Earth Observation Satellite with a Quantum Genetic Algorithm

引用

Journal of Systems Science and Information 2018年第5期9卷 399-420页

作者： Ye ZHANG Xiaoxuan HU Waiming ZHU Peng JIN School of Management Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education

This paper addresses the integrated Earth observation satellite scheduling problem. It is a complicated problem because observing and downloading operations are both involved. We use an acyclic directed graph model to describe the observing and downloading integrated scheduling *** on the model which considering energy constraints and storage capacity constraints, we develop an efficient solving method using a novel quantum genetic algorithm. We design a new encoding and decoding scheme that can generate feasible solution and increase the diversity of the *** results of the simulation experiments show that the proposed method solves the integrated Earth observation satellite scheduling problem with good performance and outperforms the genetic algorithm and greedy algorithm on all instances.

关键词： Earth observation satellite integrated scheduling quantum genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：