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

IEEE International Conference on Big knowledge (ICBK)

作者： Lei Sang Lei Li Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei China

ISBN: (数字)9781728181561

ISBN: (纸本)9781728181578

knowledge Graph (KG), which commonly consists of fruitful connected facts about items, presents an unprecedented opportunity to alleviate the sparsity problem in recommender system. However, existing KG based recommendation methods mainly rely on handcrafted meta-path features or simple triple-level entity embedding, which cannot automatically capture entities' long-term relational dependencies for the recommendation. In this paper, a two-channel neural interaction method named knowledge Graph enhanced Neural Collaborative Filtering with Residual Recurrent Network (KGNCF-RRN) is proposed, which leverages both long-term relational dependencies KG context and user-item interaction for recommendation. (1) For the KG context interaction channel, we propose a Residual Recurrent Network (RRN) to construct context-based path embedding, which incorporates residual learning into traditional recurrent neural networks (RNNs) to efficiently encode the long-term relational dependencies of KG. The self-attention network is then applied to the path embedding to capture the polysemy of various user interaction behaviours. (2) For the user-item interaction channel, the user and item embeddings are fed into a newly designed two-dimensional interaction map. (3) Finally, above the two-channel neural interaction matrix, we employ a convolutional neural network to learn complex correlations between user and item. Extensive experimental results on three benchmark datasets show that our proposed approach outperforms existing state-of-the-art approaches for knowledge graph based recommendation.

关键词： Collaboration Recurrent neural networks knowledge engineering Semantics Motion pictures Context modeling Filtering

来源：评论

学校读者我要写书评

暂无评论

Traffic Matrix Prediction in SDN based on Spatial-Temporal Residual Graph Convolutional Network

Traffic Matrix Prediction in SDN based on Spatial-Temporal R...

引用

第35届中国控制与决策会议

作者： Xintong Wang Yibo Sun Xuan Wang Enliang Wang Zhixin Sun Post Big Data Technology and Application Engineering Research Center of Jiangsu Province Nanjing University of Posts and Telecommunications Post Industry Technology Research and Development Center of the State Posts Bureau (Internet of Things Technology) Nanjing Universiry of Posts and Telecommunications Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of EducationNanjing University of Posts and Telecommunications School of Information Technology and Electrical Engineering The University of Queensland Brisbane

Traffic prediction is the basis for dynamic network services and resource *** Defined Networking(SDN) provides a global view for network measurement and management,and a reliable way for network information collection and network traffic ***,SDN traffic prediction model enabled by deep learning mainly focuses on mining the temporal correlation of traffic data,while the modeling of its spatial correlation remains to be *** the perspective of the problem,a novel Spatial-Temporal Residual Graph Convolutional Network(STRGCN) model for SDN Traffic Matrix(TM) prediction is *** with SDN network topology,TM prediction is defined as time series data prediction in non-Euclidean *** GatedConv Blocks are based on Gated Convolutional Layer,and Spatial Graph-Conv Blocks are based on Graph Convolutional Network(GCN).Through identity mapping between SpatialTemporal Conv Blocks,the deep spatial and temporal features extraction is *** by TM data from CERNET and GEANT datasets,the accuracy and the timely performance of our model are *** results suggest that the general performance of STRGCN for TM prediction in SDN is superior to the current deep learning models.

关键词： software defined networking traffic prediction traffic matrix graph convolutional neural network spatialtemporal residual graph network

来源：评论

学校读者我要写书评

暂无评论

Size-fixed group discovery via multi-constrained graph pattern matching

引用

Information Sciences 2025年 690卷

作者： Guliu Liu Lei Li Guanfeng Liu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education 230601 Hefei China School of Computer Science and Information Engineering Hefei University of Technology 230601 Hefei China Department of Computing Macquarie University Sydney 2122 Australia

Multi-Constrained Graph Pattern Matching (MC-GPM) aims to match a pattern graph with multiple attribute constraints on its nodes and edges, and has garnered significant interest in various fields, including social-based e-commerce and trust-based group discovery. However, the existing MC-GPM methods do not consider situations where the number of each node in the pattern graph needs to be fixed, such as finding experts group with expert quantities and relations specified. In this paper, a Multi-Constrained Strong Simulation with the Fixed Number of Nodes (MCSS-FNN) matching model is proposed, and then a Trust-oriented Optimal Multi-constrained Path (TOMP) matching algorithm is designed for solving it. Additionally, two heuristic optimization strategies are designed, one for combinatorial testing and the other for edge matching, to enhance the efficiency of the TOMP algorithm. Empirical experiments are conducted on four real social network datasets, and the results demonstrate the effectiveness and efficiency of the proposed algorithm and optimization strategies.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards Feature Distribution Alignment and Diversity Enhancement for data-Free Quantization

Towards Feature Distribution Alignment and Diversity Enhance...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yangcheng Gao Zhao Zhang Richang Hong Haijun Zhang Jicong Fan Shuicheng Yan School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Department of Computer Science Harbin Institute of Technology (Shenzhen) Xili University Town Shenzhen China School of Data Science The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Shenzhen China National University of Singapore Singapore

To obtain lower inference latency and less memory footprint of deep neural networks, model quantization has been widely employed in deep model deployment, by converting the floating points to low-precision integers. However, previous methods (such as quantization aware training and post training quantization) require original data for the fine-tuning or calibration of quantized model, which makes them inapplicable to the cases that original data are not accessed due to privacy or security. This gives birth to the data-free quantization method with synthetic data generation. While current data-free quantization methods still suffer from severe performance degradation when quantizing a model into lower bit, caused by the low inter-class separability of semantic features. To this end, we propose a new and effective data-free quantization method termed ClusterQ, which utilizes the feature distribution alignment for synthetic data generation. To obtain high inter-class separability of semantic features, we cluster and align the feature distribution statistics to imitate the distribution of real data, so that the performance degradation is alleviated. Moreover, we incorporate the diversity enhancement to solve class-wise mode collapse. We also employ the exponential moving average to update the centroid of each cluster for further feature distribution improvement. Extensive experiments based on different deep models (e.g., ResNet-18 and MobileNet-V2) over the ImageNet dataset demonstrate that our proposed ClusterQ model obtains state-of-the-art performance.

关键词： Degradation Training Quantization (signal) Semantics Neural networks Memory management data models

来源：评论

学校读者我要写书评

暂无评论

Research on the Loading Method of Logistics Vehicle and Cargo Based on IPSO Algorithm

Research on the Loading Method of Logistics Vehicle and Carg...

引用

第42届中国控制会议

作者： Zewei Zhao Huqing Wang Zhe Sun Lei Xu Guangfu Gong Xiangpeng Xie Zhixin Sun Post Industry Technology Research and Development Center of the State Posts Bureau (Internet of Things Technology) Nanjing University of Posts and Telecommunications Post Big Data Technology and Application Engineering Research Center of Jiangsu Province Nanjing University of Posts and Telecommunications Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of EducationNanjing University of Posts and Telecommunications

Logistics vehicle and cargo matching problem is a typical combination optimization problem,which has important theoretical and application value in the field of logistics *** proved particle swarm optimization(PSO) algorithm is one of the most extensive optimization methods studied in recent years,with excellent global search ability and convergence *** on the IPSO algorithm,this paper proposes an effective IPSO algorithm model for the matching problem of logistics vehicles and goods,and conducts the corresponding comparative *** final experimental results show that the algorithm has good results in practical application and can provide a feasible optimization method for solving the problem of logistics vehicles and goods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Unsupervised vehicle re-identification with progressive adaptation 29

Unsupervised vehicle re-identification with progressive adap...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Peng, Jinjia Wang, Yang Wang, Huibing Zhang, Zhao Fu, Xianping Wang, Meng College of Information and Science Technology Dalian Maritime University Liaoning Dalian China Pengcheng Laboratory Shenzhen Guangdong China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology China

ISBN: (纸本)9780999241165

Vehicle re-identification (reID) aims at identifying vehicles across different non-overlapping cameras views. The existing methods heavily relied on well-labeled datasets for ideal performance, which inevitably causes fateful drop due to the severe domain bias between the training domain and the real-world scenes;worse still, these approaches required full annotations, which is labor-consuming. To tackle these challenges, we propose a novel progressive adaptation learning method for vehicle reID, named PAL, which infers from the abundant data without annotations. For PAL, a data adaptation module is employed for source domain, which generates the images with similar data distribution to unlabeled target domain as "pseudo target samples". These pseudo samples are combined with the unlabeled samples that are selected by a dynamic sampling strategy to make training faster. We further proposed a weighted label smoothing (WLS) loss, which considers the similarity between samples with different clusters to balance the confidence of pseudo labels. Comprehensive experimental results validate the advantages of PAL on both VehicleID and VeRi-776 dataset. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Social Group Query Based on Multi-fuzzy-constrained Strong Simulation

arXiv

引用

arXiv 2021年

作者： Liu, Guliu Li, Lei Liu, Guanfeng Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education China School of Computer Science and Information Engineering Hefei University of Technology China Department of Computing Macquarie University Australia Mininglamp Academy of Sciences Mininglamp Technology China

Traditional social group analysis mostly uses interaction models, event models, or other methods to identify and distinguish groups. This type of method can divide social participants into different groups based on their geographic location, social relationships, and/or related events. However, in some applications, it is necessary to make more specific restrictions on the members and the interaction between members of the group. Generally, graph pattern matching (GPM) is used to solve this problem. However, the existing GPM methods rarely consider the rich contextual information of nodes and edges to measure the credibility between members. In this paper, a social group query problem that needs to consider the trust between members of the group is proposed. To solve this problem, we propose a Strong Simulation GPM algorithm (NTSS) based on the exploration of pattern Node Topological ordered sequence. Aiming at the inefficiency of the NTSS algorithm when matching pattern graph with multiple nodes with zero in-degree and the problem of repeated calculation of matched edges shared by multiple matching subgraphs, two optimization strategies are proposed. Finally, we conduct verification experiments on the effectiveness and efficiency of the NTSS algorithm and the algorithms with the optimization strategies on four social network datasets in real applications. Experimental results show that the NTSS algorithm is significantly better than the existing multi-constrained GPM algorithm, and the NTSS_Inv_EdgC algorithm, which combines two optimization strategies, greatly improves the efficiency of the NTSS algorithm. Copyright © 2021, The Authors. All rights reserved.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Multi-scale Graph Convolutional Neural Network for Object Recognition from Point Cloud data 2nd

Multi-scale Graph Convolutional Neural Network for Object Re...

引用

2nd International Conference on Urban Intelligence and Applications, ICUIA 2020

作者： Lu, Qiang Chen, Chao Teng, Jinfeng Zhang, Chunyuan Huang, Yi Xuan, Shanli Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei230009 China School of Computer and Information Hefei University of Technology Hefei230009 China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei230009 China

ISBN: (纸本)9789813346000

How to make robots understand the point cloud data which is collected from the 3D sensor and complete the recognition has become a hot research direction in recent years. In this paper, we propose a new approach to improve the critical robotic capability, semantic understanding of the environment (i.e., 3D object recognition). The convolutional neural network (CNN) method has a very good recognition result in the 2D image domain, but it has certain difficulty in applying irregular and unordered 3D point clouds data. The network for point cloud data generally uses the convolution to realize the extraction of point cloud features by finding the neighborhood features on the point set. Due to the different neighborhood scales caused by the irregularity of 3D point cloud data, we propose a CNN structure that combines multi-scale features. By finding multiple neighborhoods of the point set and establishing local graph extraction features, the stable expression of the local neighborhood is obtained. At the same time, the key point calibration method is added, so that the network can dynamically focus on key point features to improve the recognition result. In a series of analytical experiments, we demonstrate competing results that demonstrate the effectiveness of the network structure. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Automatically labeling Aging Scenarios with a Machine Learning Approach 1

引用

24th International Conference on Human-Computer Interaction, HCII 2022

作者： An, Ning Xu, Yang Gao, Qinglin Zhu, Wenjie Wu, Aoran Chen, Honglin School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Shanghai Tianyu Senior Living Service Co. Ltd. Shanghai China School of Basic Courses Bengbu Medical College Bengbu China Management and Business Department Skidmore College Saratoga SpringsNY United States Department of Social Sciences University of Eastern Finland Kuopio70150 Finland

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

Older adults have diversified needs often associated with particular aging scenarios. People started to use aging scenarios to provide better Smart Eldercare services and develop innovative solutions. The problem is how to manage these scenarios effectively. To our best knowledge, this study is the first to develop a model to provide a structured framework of aging scenarios for research and teaching of eldercare services. labeling aging scenarios can facilitate their collection, classification, and consolidation within this model. This study uses the automatic labeling approach to manage and utilize aging scenarios. Under each class, there are labels with different numbers and smaller granularity to reflect the requirements in each scenario case. Since a scenario case often involves more than one label, properly labeling it becomes a multi-label text classification problem. We extend the multi-label text classification model LSAN for labeling aging scenario cases. For evaluation purposes, we collected 938 scenario cases as the dataset. Experimental results show that our proposed method can achieve an average accuracy of 61.66%, better than other classical methods. © 2022, Springer Nature Switzerland AG.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Vehicle Segmentation with Coarse Distance Estimation Based on Monocular Vision

Vehicle Segmentation with Coarse Distance Estimation Based o...

引用

IEEE International Conference on e-Business engineering (ICEBE)

作者： Fangyuan Xie Pengshuai Yin Zehui Ke Ruizhou Sun Ke Ding Jian Chen Qingyao Wu School of Software Engineering South China University of Technology Guangzhou China Key Laboratory of Big Data and Intelligent Robot Ministry of Education China Pazhou Lab Guangzhou China

ISBN: (纸本)9781665444194

With the increasing population of drivers and the popularity of intelligent cars, traffic safety is becoming more concerned. Aiming to reduce the probability of road accidents, many works have explored how to provide an early warning when the distances between the current car (or the in-car camera) and vehicles ahead are dangerous. In this paper, benefiting from the robust pixel-level understanding of cutting-edge deep networks, we introduce a vehicle segmentation method based on monocular vision, detecting vehicles in front of the current one and generating a segmentation mask for each vehicle instance detected. Instead of concentrating our efforts on measuring distance precisely, we categorize distances into three classes (“near”, “medium”, and “far”), which are pretty enough for an early collision warning. Our model is trained and evaluated on our hand-made dataset, after which we transfer and deploy it onto an Android TV virtual machine to test its performance. All the results we got show that our method does a good job in vehicle segmentation with coarse distance estimation, being applicable to aided driving.

关键词： TV Sociology Estimation Cameras Virtual machining Safety Automobiles

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：