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

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Tianhao Chen Qian Gao Jun Fan Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan Shandong China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan Shandong China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan Shandong China China Telecom Digital Intelligence Techonology Co Ltd Jinan Shandong China

Group recommendation involves comprehensively considering various aspects, including members and items, to predict the overall interests of a group and recommend suitable items through a recommendation system. With the rapid evolution of the Internet, online group activities have become increasingly prevalent, making group recommendation a highly discussed topic within the realm of recommendation systems. However, current research in group recommendation still confronts the following challenges. Firstly, a predominant portion of group recommendation research focuses solely on aggregating group-level information, neglecting the valuable contribution of higher-order member-level insights to group recommendation. Moreover, some aggregation strategies overly prioritize fairness, thereby disregarding common real-world patterns. Secondly, previous studies have primarily relied on aggregating individual member interests to establish group preferences, lacking a holistic consideration of group dynamics. To tackle these challenges, this study introduces an innovative approach by implementing multi-channel hypergraph convolution within the member perspective. This approach aims to effectively extract higher-order insights from members by utilizing a member information enhancement module. By establishing group interconnections based on similarity and employing an adaptive fusion network to amalgamate multiple viewpoints, a final representation is derived. Experimental results demonstrate that our proposed model surpasses baseline models by 3% to 4% in terms of hit rate and accuracy, validating the efficacy of our approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Multi-Query Oriented Continuous Subgraph Matching

Efficient Multi-Query Oriented Continuous Subgraph Matching

引用

International Conference on Data Engineering

作者： Ziyi Ma Jianye Yang Xu Zhou Guoqing Xiao Jianhua Wang Liang Yang Kenli Li Xuemin Lin School of Artificial Intelligence Hebei University of Technology China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University China Cyberspace Institute of Advanced Technology Guangzhou University China Department of New Networks PengCheng Laboratory China College of Computer Science and Electronic Engineering Hunan University China Shenzhen Research Institute Hunan University China Antai College of Economics and Management Shanghai Jiao Tong University China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Continuous subgraph matching (CSM) is a critical task for analyzing dynamic graphs and has a wide range of applications, such as merchant fraud detection, cyber-attack hunting, and rumor detection. Although many efficient CSM algorithms have been recently proposed, they are mainly designed to process a single query. However, in some application scenarios, multi-query oriented continuous subgraph matching (MQCSM) may be of more interest. To our knowledge, the two existing solutions to MQCSM are outdated due to unsatisfactory performance. In this paper, we propose MQ-Match, an efficient approach to MQCSM. First, we design a compact yet effective index structure CCG, which maintains the local matching result of vertices in the data graph using a directed graph. The directed edges in CCG can be utilized as an effective pruning rule for the subsequent incremental matching algorithm when expanding a partial match. Then, we develop a computation sharing incremental matching algorithm. In specific, a set of matching trees is constructed based on the depth-first search trees of the query graphs. By utilizing CCG, we conduct subgraph matching for the matching tree to collect the incremental matches for the query graphs, where the common structures of query graphs are matched only once. Extensive experiments show that MQ-Match can achieve 3.1x-7071.4x speedup over the competitors, and consumes much less memory under the majority of the experiment settings.

关键词： Heuristic algorithms Memory management Directed graphs Data engineering Fraud Computational efficiency Indexes

来源：评论

学校读者我要写书评

暂无评论

Cluster Assumption-Guided Timestamp-Supervised Temporal Action Segmentation

引用

IEEE Transactions on Multimedia 2025年

作者： Ren, Ziyou Li, Guozhang Cheng, Nan Wu, Anqi Wang, Nannan Gao, Xinbo Xidian University State Key Laboratory of Integrated Services Networks School of Telecommunications Engineering Shaanxi Xi'an710071 China Carnegie Mellon University Robotics Institute School of Computer Science PittsburghPA15213 United States Beijing Normal University School of Artificial Intelligence Haidian District Beijing100875 China Georgia Institute of Technology School of Computational Science and Engineering College of Computing AtlantaGA30308 United States Xidian University School of Electronic Engineering Xi'an710071 China Chongqing University of Posts and Telecommunications Chongqing Key Laboratory of Image Cognition Chongqing400065 China

Current timestamp-supervised temporal action segmentation (TS-TAS) methods typically follow a two-phase pipeline: initializing the model with timestamp labels and refining it with pseudo-labels. However, limited by the sparsity of timestamp annotations, current methods' performance is sub-optimal. Specifically, initializing the model with only timestamp annotations may cause overfitting to labeled frames. Additionally, sparse timestamp annotations cannot capture the diverse action representations throughout the whole instance, especially those near the ambiguous action boundaries, leading to pseudo-label noise. Inspired by the cluster assumption of semi-supervised learning (SSL) that points within the same manifold likely share the same label, we here model TS-TAS as an SSL problem. Specifically, we propose a Temporal Embedding Consistency (TEC) strategy to mitigate the excessive focus on annotated frames. The TEC strategy encourages frames with similar representations within the video to have similar classification probability distributions, thereby propagating labeled frames' information to implicit ones. Besides, we design a TS-Mix strategy to further leverage unlabeled data to mitigate the influence of pseudo-label noise in a consistency regularization manner. The TS-Mix strategy includes intra-mix, which adds linear interpolation of two adjacent timestamps to every frame between them, and inter-mix, which mixes frames from two different untrimmed videos frame-by-frame. Then the mixed video is trained with the correspondingly mixed pseudo-labels. Comprehensive experimental results on different benchmarks show that we achieve new state-of-the-art performances. Furthermore, the proposed method can seamlessly enhance existing methods, significantly improving their performances. © 1999-2012 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Semantic Feature Division Multiple Access for Digital Semantic Multiple Access Channels

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Shen, Bin Ma, Shuai Chen, Rui Wu, Youlong Li, Hang Shi, Guangming Li, Shiyin Al-Dhahir, Naofal China University of Mining and Technology School of Information and Control Engineering Xuzhou221116 China Xidian University State Key Laboratory of Integrated Service Networks School of Telecommunications Engineering Shaanxi Xi'an710071 China ShanghaiTech University School of Information Science and Technology Shanghai201210 China Shenzhen Research Institute of Big Data Guangdong Shenzhen518172 China Xidian University School of Artificial Intelligence Shaanxi Xi'an710071 China Peng cheng Laboratory Shenzhen518066 China The University of Texas at Dallas Department of Electrical and Computer Engineering RichardsonTX75080 United States

To solve the multi-user semantic communication network capacity bottlenecks, this paper proposes a semantic feature domain multiple access (SFDMA) scheme. By extracting and encoding semantic features and jointly processing multi-user data, the scheme can realize the encoding and transmission of multi-user semantic information in the separated feature subspace. Based on this scheme, a semantic digital multiple access network model is proposed to perform multi-user inference tasks, and an efficient semantic encoding and decoding scheme is developed by using variational information bottleneck (VIB) theory to ensure both the orthogonality in the feature domain and the classification accuracy. Furthermore, a SFDMA model for image reconstruction is designed based on the Swin Transformer. The modified model also considers the reconstruction quality and orthogonality of semantic feature domain. In addition, we design an optimization target for multiple access to implement an adaptive power allocation method for multi-user semantic communications. Simulation results show that our proposed SFDMA scheme exhibits semantic feature domain orthogonality in different applications, and the adaptive power allocation method shows excellent performance in the classification task, and effectively guarantee the quality of service (QoS) of the semantic communications. © 2015 IEEE.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Density-aware and Depth-aware Visual Representation for Zero-Shot Object Counting

Density-aware and Depth-aware Visual Representation for Zero...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Fang Nan Feng Tian Ni Zhang Nian Liu Haonan Miao Guang Dai Mengmeng Wang Faculty of Electronic and Information Engineering Xi’an Jiaotong University Xi’an China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an China School of Automation Northwestern Polytechnical University Xi’an China Computer Vision Department Mohamed bin Zayed University of Artificial Intelligence Abu Dhabi UAE SGIT AI Lab State Grid Corporation of China Zhejiang University of Technology Hang Zhou China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Previous methods often utilize CLIP semantic classifiers with class names for zero-shot object counting. However, they ignore crucial density and depth knowledge for counting tasks. Thus, we propose a density-aware and depth-aware prompt counting model, which captures density information via learning density-aware prompts based on density-aware contrastive loss and incorporates depth guidance with predefined depth-aware prompts. To facilitate the training process, we design two strategies for standard counting loss and the contrastive loss, where the former prioritizes larger and sparser objects initially, gradually focusing on smaller and denser objects, and the latter adopts coarse-to-fine density learning. Besides, we construct a dataset named LVIS-372 with more real-world scenarios and balanced instance distribution compared to existing ones. Finally, the experimental results demonstrate the effectiveness of our proposed method.

关键词： Training Visualization Semantics Focusing Signal processing Acoustics Power capacitors Speech processing Standards

来源：评论

学校读者我要写书评

暂无评论

Intelligent Reflecting Surface Enabled Sensing: Cramér-Rao Lower Bound Optimization

arXiv

引用

arXiv 2022年

作者： Song, Xianxin Xu, Jie Liu, Fan Han, Tony Xiao Eldar, Yonina C. School of Science and Engineering Future Network of Intelligence Institute Guangdong Provincial Key Laboratory of Future Networks of Intelligence The Chinese University of Hong Kong Shenzhen China Department of Electrical and Electronic Engineering Southern University of Science and Technology China Wireless Technology Lab Laboratories 2012 Huawei China Faculty of Mathematics and Computer Science Weizmann Institute of Science Israel

This paper investigates intelligent reflecting surface (IRS) enabled non-line-of-sight (NLoS) wireless sensing, in which an IRS is deployed to assist an access point (AP) to sense a target in its NLoS region. It is assumed that the AP is equipped with multiple antennas and the IRS is equipped with a uniform linear array. The AP aims to estimate the target's direction-of-arrival (DoA) with respect to the IRS, based on the echo signals from the AP-IRS-target-IRS-AP link. Under this setup, we jointly design the transmit beamforming at the AP and the reflective beamforming at the IRS to minimize the Cramér-Rao lower bound (CRLB) on estimation error. Towards this end, we first obtain the CRLB expression for estimating the DoA in closed form. Next, we optimize the joint beamforming design to minimize the CRLB, via alternating optimization, semi-definite relaxation, and successive convex approximation. Numerical results show that the proposed design based on CRLB minimization achieves improved sensing performance in terms of mean squared error, as compared to the traditional schemes with signal-to-noise ratio maximization and separate beamforming. Copyright © 2022, The Authors. All rights reserved.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Intelligent Reflecting Surface Enabled Sensing: Cramér-Rao Lower Bound optimization

Intelligent Reflecting Surface Enabled Sensing: Cramér-Rao ...

引用

IEEE Globecom Workshops

作者： Xianxin Song Jie Xu Fan Liu Tony Xiao Han Yonina C. Eldar School of Science and Engineering Future Network of Intelligence Institute and Guangdong Provincial Key Laboratory of Future Networks of Intelligence The Chinese University of Hong Kong (Shenzhen) China Department of Electrical and Electronic Engineering Southern University of Science and Technology China wireless Technology Lab 2012 Laboratories Huawei China Faculty of Mathematics and Computer Science Weizmann Institute of Science Israel

ISBN: (纸本)9781665459761

This paper investigates intelligent reflecting surface (IRS) enabled non-line-of-sight (NLoS) wireless sensing, in which an IRS is deployed to assist an access point (AP) to sense a target in its NLoS region. It is assumed that the AP is equipped with multiple antennas and the IRS is equipped with a uniform linear array. The AP aims to estimate the target’s direction-of-arrival (DoA) with respect to the IRS, based on the echo signals from the AP-IRS-target-IRS-AP link. Under this setup, we jointly design the transmit beamforming at the AP and the reflective beamforming at the IRS to minimize the CramérRao lower bound (CRLB) on estimation error. Towards this end, we first obtain the CRLB expression for estimating the DoA in closed form. Next, we optimize the joint beamforming design to minimize the CRLB, via alternating optimization, semi-definite relaxation, and successive convex approximation. Numerical results show that the proposed design based on CRLB minimization achieves improved sensing performance in terms of mean squared error, as compared to the traditional schemes with signal-to-noise ratio maximization and separate beamforming.

关键词： Wireless communication Wireless sensor networks Estimation error Direction-of-arrival estimation Array signal processing Minimization Sensors

来源：评论

学校读者我要写书评

暂无评论

Research on Sentiment Dictionary Based on Sentiment Analysis in News Domain 7

Research on Sentiment Dictionary Based on Sentiment Analysis...

引用

7th IEEE International Conference on Big Data Security on Cloud, 7th IEEE International Conference on High Performance and Smart Computing, and 6th IEEE International Conference on Intelligent Data and Security, BigDataSecurity/HPSC/IDS 2021

作者： Gao, Yihang Su, Peng Zhao, Hui Qiu, Meikang Liu, Meiqin Henan International Joint Laboratory of Theories Key Technologies on Intelligence Networks Henan University Kaifeng China Intelligent Data Processing Engineering Research Center of Henan Province Henan University Kaifeng China Educational Information Technology Laboratory Henan University Kaifeng China Texas Am University-Commerce Department of Computer Science CommerceTX75428 United States College of Electrical Engineering Zhejiang University Hangzhou310027 China

ISBN: (纸本)9781665439275

The known Chinese sentiment dictionary has universal applicability, lacks the expansion of proprietary domains, and lacks support for network words. This paper proposes a new approach and applies it to the Internet news sentiment analysis text provided by the CCF Big Data Computing intelligence Contest. First, the corpus is segmented in Chinese to obtain candidate sentiment words that have not appeared in the sentiment dictionary. The candidate sentiment words are calculated in different sentimental texts. The proportion of appearance is obtained, and the emotional tendency of candidate emotional words is obtained, and then it is merged with the emotional vocabulary ontology database to obtain the expanded emotional dictionary. Experiments show that the expanded sentiment dictionary is better than the known Chinese sentiment vocabulary ontology database in the above corpus. © 2021 IEEE.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Dual Representation Learning for One-Step Clustering of Multi-View Data

arXiv

引用

arXiv 2022年

作者： Zhang, Wei Deng, Zhaohong Choi, Kup-Sze Wang, Jun Wang, Shitong The School of Artificial Intelligence and Computer Science Jiangnan University Jiangsu Key Laboratory of Media Design and Software Technology Wuxi214122 China The School of Artificial Intelligence and Computer Science Jiangnan University Wuxi214122 China ZJLab Shanghai200433 China The Centre for Smart Health The Hong Kong Polytechnic University Hong Kong The Key laboratory of Specialty Fiber Optics and Optical Access Networks Joint International Research Laboratory of Specialty Fiber Optics and Advanced Communication Shanghai Institute for Advanced Communication and Data Science School of Communication and Information Engineering Shanghai University Shanghai200444 China

Multi-view data are commonly encountered in data mining applications. Effective extraction of information from multi-view data requires specific design of clustering methods to cater for data with multiple views, which is non-trivial and challenging. In this paper, we propose a novel one-step multi-view clustering method by exploiting the dual representation of both the common and specific information of different views. The motivation originates from the rationale that multi-view data contain not only the consistent knowledge between views but also the unique knowledge of each view. Meanwhile, to make the representation learning more specific to the clustering task, a one-step learning framework is proposed to integrate representation learning and clustering partition as a whole. With this framework, the representation learning and clustering partition mutually benefit each other, which effectively improves the clustering performance. Results from extensive experiments conducted on benchmark multi-view datasets clearly demonstrate the superiority of the proposed method. Copyright © 2022, The Authors. All rights reserved.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

TSGN: Transaction Subgraph networks Assisting Phishing Detection in Ethereum

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Wang, Jinhuan Chen, Pengtao Xu, Xinyao Wu, Jiajing Shen, Meng Xuan, Qi Yang, Xiaoniu Zhejiang University of Technology Institute of Cyberspace Security College of Information Engineering Hangzhou310023 China ZJUT Binjiang Institute of Artificial Intelligence Hangzhou310056 China Fudan University Adaptive Networks and Control Lab Department of Electronic Engineering School of Information Science and Technology Shanghai200433 China Sun Yat-sen University School of Computer Science and Engineering Guangzhou510006 China Beijing Institute of Technology School of Cyberspace Science and Technology Beijing100081 China Shenzhen518066 China National Key Laboratory of Electromagnetic Space Security Jiaxing314033 China

Due to the decentralized and public nature of the blockchain ecosystem, malicious activities on the Ethereum platform impose immeasurable losses on users. At the same time, the transparency of cryptocurrency transactions provides a unique opportunity to analyze illegal activities, such as phishing scams, from a network perspective. Most existing phishing scam detection methods focus primarily on analyzing account interaction networks, which limits their ability to uncover transaction behavior patterns embedded within transaction interactions. To address this, we construct the Transaction SubGraph Network (TSGN) by using transaction subgraphs as basic elements and further propose a novel framework for Ethereum phishing account detection. Specifically, we rebuild the graph structures via three well-designed mapping mechanisms, yielding TSGN and its two variants, i.e., Directed-TSGN and Temporal-TSGN, to obtain direction-aware and time-aware transfer flow features. By further incorporating the mapping strategy into transaction multidigraphs, we develop the Multiple-TSGN, which could preserve more transaction flow features while concurrently reducing the time consumption of modeling large-scale networks. TSGN models based on transaction subgraph interactions can capture complex higher-order dependencies, which lay beyond the reach of models that exclusively capture pairwise account interactions. As a general framework, our model can incorporate various feature extraction methods to improve the performance of phishing detection. Extensive experimental results on Ethereum datasets show that our method achieves superior performance in phishing detection, yielding 3.27%∼6.71% relative improvement over previous state-of-the-art. © 2004-2012 IEEE.

关键词： Phishing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：