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

Personality-based and trust-aware products recommendation in social networks

Applied Intelligence 2023年第1期53卷 879-903页

作者： Vatani, Nasim Rahmani, Amir Masoud Javadi, Hamid Haj Seyyed Department of Computer Engineering Science and Research Branch Islamic Azad University Tehran Iran Future Technology Research Center National Yunlin University of Science and Technology 123 University Road Section 3 Yunlin Douliou64002 Taiwan Department of Mathematics and Computer Science Shahed University Tehran Iran

In recent years, with the development of technology, the shopping approach of people has moved towards pervasive online social shopping. As a result, how to create a recommendation algorithm that offers products based on the personal and different needs and tastes of people on social networks is a significant research issue. This article proposes a personality-based and trust-aware probabilistic product recommendation algorithm in social networks. We present a dynamic method for determining how similar people in social networks are. For this purpose, we consider the personality-based features of recommendation attributes of products in social networks. Then, the level of trust of products and types of correlations among the products is considered to create a probabilistic matrix of product recommendation. Moreover, for solving the cold start problem of products, we consider qualitative aspects of products while exploiting personality-based user behavior regarding their purchases. At last, the empirical experiments are conducted to analyze the impact of the algorithm’s different influence factors using the Amazon dataset. Moreover, the results of comprehensive experiments adopted to verify the proposed personalized recommendation algorithm’s effectiveness show that the proposed algorithm has the appropriate effectiveness and the higher accuracy. © 2022, The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature.

关键词： Behavioral research

来源：评论

学校读者我要写书评

暂无评论

A Scalable Algorithm for Fair Influence Maximization with Unbiased Estimator

引用

IEEE Transactions on Knowledge and Data engineering 2025年第7期37卷 3881-3895页

作者： Rui, Xiaobin Wang, Zhixiao Peng, Hao Chen, Wei Yu, Philip S. China University of Mining and Technology School of Computer Science Jiangsu Xuzhou221116 China Mine Digitization Engineering Research Center of the Ministry of Education Jiangsu Xuzhou221116 China Beihang University School of Cyber Science and Technology Beijing100191 China Theory Center of Microsoft Research Asia Beijing100080 China University of Illinois at Chicago Department of Computer Science ChicagoIL60607 United States

This paper studies the fair influence maximization problem with efficient algorithms. In particular, given a graph G, a community structure C consisting of disjoint communities, and a budget k, the problem asks to select a seed set S (||S|| = k) that maximizes the influence spread while narrowing the influence gap between different communities. This problem derives from some significant social scenarios, such as health interventions (e.g. suicide/HIV prevention) where individuals from racial minorities or LGBTQ communities may be disproportionately excluded from the benefits of the intervention. To depict the concept of fairness in the context of influence maximization, researchers have proposed various notions of fairness, where the welfare fairness notion that better balances fairness level and influence spread has shown promising effectiveness. However, the lack of efficient algorithms for optimizing the objective function under welfare fairness restricts its application to networks of only a few hundred nodes. In this paper, we modify the objective function of welfare fairness to maximize the exponentially weighted sum and the logarithmically weighted sum over all communities' influenced fractions (utility). To achieve efficient algorithms with theoretical guarantees, we first introduce two unbiased estimators: one for the fractional power of the arithmetic mean and the other for the logarithm of the arithmetic mean. Then, by adapting the Reverse Influence Sampling (RIS) approach, we convert the optimization problem to a weighted maximum coverage problem. We also analyze the number of reverse reachable sets needed to approximate the fair influence at a high probability. Finally, we present an efficient algorithm that guarantees 1 - 1/e - ϵ (positive objective function) or 1 + 1/e + ϵ (negative objective function) approximation for any small ϵ > 0. Experiments demonstrate that our proposed algorithm could efficiently handle large-scale networks with good performa

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-trial Vector-based Whale Optimization Algorithm

引用

Journal of Bionic engineering 2024年第3期21卷 1465-1495页

作者： Mohammad H.Nadimi-Shahraki Hajar Farhanginasab Shokooh Taghian Ali Safaa Sadiq Seyedali Mirjalili Faculty of Computer Engineering Najafabad BranchIslamic Azad UniversityNajafabad***Iran Big Data Research Center Najafabad BranchIslamic Azad UniversityNajafabad***Iran Department of Computer Science Nottingham Trent UniversityNottinghamNG118NSUK Centre for Artificial Intelligence Research and Optimisation Torrens UniversityBrisbane4006Australia

The Whale Optimization Algorithm(WOA)is a swarm intelligence metaheuristic inspired by the bubble-net hunting tactic of humpback *** spite of its popularity due to simplicity,ease of implementation,and a limited number of parameters,WOA’s search strategy can adversely affect the convergence and equilibrium between exploration and exploitation in complex *** address this limitation,we propose a new algorithm called Multi-trial Vector-based Whale Optimization Algorithm(MTV-WOA)that incorporates a Balancing Strategy-based Trial-vector Producer(BS_TVP),a Local Strategy-based Trial-vector Producer(LS_TVP),and a Global Strategy-based Trial-vector Producer(GS_TVP)to address real-world optimization problems of varied degrees of ***-WOA has the potential to enhance exploitation and exploration,reduce the probability of being stranded in local optima,and preserve the equilibrium between exploration and *** the purpose of evaluating the proposed algorithm's performance,it is compared to eight metaheuristic algorithms utilizing CEC 2018 test ***,MTV-WOA is compared with well-stablished,recent,and WOA variant *** experimental results demonstrate that MTV-WOA surpasses comparative algorithms in terms of the accuracy of the solutions and convergence ***,we conducted the Friedman test to assess the gained results statistically and observed that MTV-WOA significantly outperforms comparative ***,we solved five engineering design problems to demonstrate the practicality of *** results indicate that the proposed MTV-WOA can efficiently address the complexities of engineering challenges and provide superior solutions that are superior to those of other algorithms.

关键词： Swarm intelligence algorithms Metaheuristic algorithms Optimization engineering design problems Whale optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Detecting Double Mixed Compressed Images Based on Quaternion Convolutional Neural Network

引用

Chinese Journal of Electronics 2024年第3期33卷 657-671页

作者： Hao WANG Jinwei WANG Xuelong HU Bingtao HU Qilin YIN Xiangyang LUO Bin MA Jinsheng SUN Department of Automation Nanjing University of Science and Technology Engineering Research Center of Digital Forensics Ministry of Education Department of Computer and Software Nanjing University of Information Science and Technology School of Management Nanjing University of Posts and Telecommunications Department of Computer Science and Engineering Guangdong Province Key Laboratory of Information Security Technology Sun Yat-sen University State Key Laboratory of Mathematical Engineering and Advanced Computing Qilu University of Technology

Detection of color images that have undergone double compression is a critical aspect of digital image *** the existence of various methods capable of detecting double Joint Photographic Experts Group(JPEG) compression,they are unable to address the issue of mixed double compression resulting from the use of different compression *** particular,the implementation of Joint Photographic Experts Group 2000(JPEG2000)as the secondary compression standard can result in a decline or complete loss of performance in existing *** tackle this challenge of JPEG+JPEG2000 compression,a detection method based on quaternion convolutional neural networks(QCNN) is *** QCNN processes the data as a quaternion,transforming the components of a traditional convolutional neural network(CNN) into a quaternion *** relationships between the color channels of the image are preserved,and the utilization of color information is ***,the method includes a feature conversion module that converts the extracted features into quaternion statistical features,thereby amplifying the evidence of double *** results indicate that the proposed QCNN-based method improves,on average,by 27% compared to existing methods in the detection of JPEG+JPEG2000 compression.

关键词： Color image forensics JPEG JPEG2000 Mixed double compression Quaternion convolutional neural network

来源：评论

学校读者我要写书评

暂无评论

Ghost Module Based Residual Mixture of Self-Attention and Convolution for Online Signature Verification

引用

computers, Materials & Continua 2024年第4期79卷 695-712页

作者： Fangjun Luan Xuewen Mu Shuai Yuan Department of Computer Technology School of Computer Science and EngineeringShenyang Jianzhu UniversityShenyang110168China Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang Jianzhu UniversityShenyang110168China Shenyang Branch of National Special Computer Engineering Technology Research Center Shenyang Jianzhu UniversityShenyang110168China

Online Signature Verification (OSV), as a personal identification technology, is widely used in various ***, it faces challenges, such as incomplete feature extraction, low accuracy, and computational heaviness. Toaddress these issues, we propose a novel approach for online signature verification, using a one-dimensionalGhost-ACmix Residual Network (1D-ACGRNet), which is a Ghost-ACmix Residual Network that combines convolutionwith a self-attention mechanism and performs improvement by using Ghost method. The Ghost-ACmix Residualstructure is introduced to leverage both self-attention and convolution mechanisms for capturing global featureinformation and extracting local information, effectively complementing whole and local signature features andmitigating the problem of insufficient feature extraction. Then, the Ghost-based Convolution and Self-Attention(ACG) block is proposed to simplify the common parts between convolution and self-attention using the Ghostmodule and employ feature transformation to obtain intermediate features, thus reducing computational ***, feature selection is performed using the random forestmethod, and the data is dimensionally reducedusing Principal Component Analysis (PCA). Finally, tests are implemented on the MCYT-100 datasets and theSVC-2004 Task2 datasets, and the equal error rates (EERs) for small-sample training using five genuine andforged signatures are 3.07% and 4.17%, respectively. The EERs for training with ten genuine and forged signaturesare 0.91% and 2.12% on the respective datasets. The experimental results illustrate that the proposed approacheffectively enhances the accuracy of online signature verification.

关键词： Online signature verification feature selection ACG block ghost-ACmix residual structure

来源：评论

学校读者我要写书评

暂无评论

Drawing Order Diagrams Through Two-Dimension Extension

引用

Journal of Graph Algorithms and Applications 2023年第9期27卷 783-802页

作者： Dürrschnabel, Dominik Hanika, Tom Stumme, Gerd Knowledge & Data Engineering Group Research Center for Information System Design & Department of Electrical Engineering and Computer Science University of Kassel Germany Institute of Computer Science University of Hildesheim Germany Berlin School of Library and Information Science Humboldt-Universität zu Berlin Germany

Ordinal real-world data such as concept hierarchies, ontologies, genealogies, or task dependencies in scheduling often has the property to not only contain pairwise comparable, but also incomparable elements. Order diagrams provide an important tool for understanding and thus discovering knowledge in such data. Easily readable drawings of such order diagrams are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work, we present the novel algorithm DimDraw to decompose an ordered set (e.g., a concept hierarchy) in linear orders and to produce a corresponding order diagram. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of its transitive incompatibility graph. To evaluate the quality of the algorithm, a user study was conducted where generated drawings were compared with ones from state-of-the-art drawing algorithms. © 2023 Brown University. All rights reserved.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

Multi-Task Learning for UAV Trajectory and Caching With Federated Cloud-Assisted Knowledge Distillation

引用

IEEE Transactions on Network and Service Management 2025年第3期22卷 2516-2533页

作者： Tietaa Maale, Gerald Arden Elorm Kuadey, Noble Arafat, Yeasin Thomas, Kwantwi Sun, Guolin Liu, Guisong Research Institute of Intelligent Computing University of Electronic Science and Technology of China School of Computer Science and Engineering National Key Laboratory of Intelligent Collaborative Computing Chengdu611731 China McCoy University College of Education Department of Mathematics and ICT Nadowli Ghana Research Institute of Intelligent Computing at the University of Electronic Science and Technology of China School of Computer Science and Engineering National Key Laboratory of Intelligent Collaborative Computing Chengdu611731 China Ho Technical University Department of Computer Science Ho Ghana University of Mines and Technology Department of Computer Science and Engineering Tarkwa Ghana Southwestern University of Finance and Economics Complex Laboratory of New Finance and Economics School of Computing and Artificial Intelligence Chengdu610074 China Ministry of Education Engineering Research Center of Intelligent Finance Chengdu610030 China

The proliferation of Internet of Things (IoT) technologies and ubiquitous connectivity has led to uncrewed aerial vehicles (UAVs) playing key role as edge servers, revolutionizing the wireless communications landscape by facilitating computing and caching resources closer to ground users (GUs). This advancement significantly alleviates core network loads, reduces latency, and guarantees content availability even in congested or remote areas. However, jointly optimizing UAV caching strategies and trajectories gives rise to a multi-task optimization (MTO) problem. This paper introduces a novel multi-task geo-temporal caching (MT-GTC) framework that addresses the interplay between UAV caching mechanisms and trajectory optimization in a cohesive manner. Leveraging a proposed multi-task learning (MTL) model for joint optimization of UAV caching and trajectory design, we develop a federated learning cloud-assisted knowledge distillation (FL-CAKD) scheme to preserve data privacy and adapt to data heterogeneity. FL-CAKD transfers knowledge from a cloud model orchestrator (CMO), which houses a large and sophisticated teacher model, to a lightweight on-device MTL student models using soft target distributions instead of large model parameters, significantly reducing communication costs. MT-GTC optimizes caching and trajectories to maximize cache hits and minimize latency. Evaluations on real-world mobility datasets demonstrate up to 95% cache hit rates and 21% lower delays compared to baselines. © 2004-2012 IEEE.

关键词： Multi-task learning

来源：评论

学校读者我要写书评

暂无评论

Multi-modal Interaction with Virtual Agents: A Pick-up and Placement Case Study

Multi-modal Interaction with Virtual Agents: A Pick-up and P...

引用

2025 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops, VRW 2025

作者： Bazargani, Jalal Safari Choi, Soo-Mi Sejong University Department of Computer Science and Engineering and Convergence Engineering for Intelligent Drone Xr Research Center Seoul Korea Republic of

ISBN: (纸本)9798331514846

This paper presents a multi-modal human-agent interaction framework that integrates hand tracking, voice commands, user intention interpretation, and scene understanding using large language and vision models for object pick-up and placement tasks in VR. Scene understanding integrates object tags and ChatGPT-4V's object detection. User commands are processed via the LLaMA-3.2 model, which interprets user intention, identifies task and reference objects, and spatial relationships for task execution. An initial experiment with 15 participants showed that the multimodal approach achieved the fastest task completion times and highest user satisfaction. While hand-only interaction was comparable, voice-only interaction was significantly slower. © 2025 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Lane and Platoon Assignment in Intelligent Transportation System: A Novel Heuristic Approach

引用

International Journal of Intelligent Transportation Systems research 2024年第2期22卷 298-315页

作者： Mahini, Hamidreza Asadi, Mehrdad Mahini, Alireza Rahmani, Amir Masoud Fathy, Mahmood Department of Computer Engineering Gorgan Branch Islamic Azad University Gorgan Iran Vrije Universiteit Brussel Brussels Belgium Future Technology Research Center National Yunlin University of Science and Technology 123 University Road Section 3 Yunlin Douliou64002 Taiwan Department of Computer Engineering Iran University of Science and Technology Tehran Iran

The right lane and platoon assignment to a vehicle significantly impacts achieving the desired driving goals to improve occupants’ safety or reduce pollution. Preparing an intelligent assistant to address this issue has exposed researchers’ attention, especially in intelligent transportation systems. Implementing such a system is complex and challenging to design, mainly because of conflicting driving goals possibility and the mixed traffic of autonomous and human-driven vehicles. This paper presents a multi-tier computational architecture to utilize the cloud, fog, and edge computational resources and formulate the lane/platoon assignment as an optimization problem subject to safety combined with any other secondary goal. The problem is then solved by the meta-heuristic Genetic Algorithm. By evaluating the proposed method by real data gathering, machine learning, and numerical experiments, the results show that the proposed method satisfies the minimization of overlapping collision areas during vehicles’ lane/platoon changes and harmonizes the traffic in all lanes and each platoon. © The Author(s), under exclusive licence to Intelligent Transportation Systems Japan 2024.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Soft-GNN:towards robust graph neural networks via self-adaptive data utilization

引用

Frontiers of computer science 2025年第4期19卷 1-12页

作者： Yao WU Hong HUANG Yu SONG Hai JIN National Engineering Research Center for Big Data Technology and System Service Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China College of Information and Communication National University of Defense TechnologyWuhan 430019China Department of Computer Science and Operations Research Universitéde MontréalMontreal H3C 3J7Canada

Graph neural networks(GNNs)have gained traction and have been applied to various graph-based data analysis tasks due to their high ***,a major concern is their robustness,particularly when faced with graph data that has been deliberately or accidentally polluted with *** presents a challenge in learning robust GNNs under noisy *** address this issue,we propose a novel framework called Soft-GNN,which mitigates the influence of label noise by adapting the data utilized in *** approach employs a dynamic data utilization strategy that estimates adaptive weights based on prediction deviation,local deviation,and global *** better utilizing significant training samples and reducing the impact of label noise through dynamic data selection,GNNs are trained to be more *** evaluate the performance,robustness,generality,and complexity of our model on five real-world datasets,and our experimental results demonstrate the superiority of our approach over existing methods.

关键词： graph neural networks node classification label noise robustness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：