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

Hyponymy Graph Model for Word Semantic Similarity Measurement

Chinese Journal of Electronics 2015年第1期24卷 96-101页

作者： WANG Junhua ZUO Wanli PENG Tao College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering attached to the Ministry of Education

Measuring word semantic similarity is a generic problem with a broad range of applications such as ontology mapping, computational linguistics and artificial intelligence. Previous approaches to computing word semantic similarity did not consider concept occurrence frequency and word’s sense number. This paper introduced Hyponymy graph, and based on which proposed a novel word semantic similarity model. For two words to be compared, we first retrieve their related concepts; then produce lowest common ancestor matrix and distance matrix between concepts; finally calculate distance-based similarity and information-based similarity, which are integrated to get final semantic similarity. The main contribution of our method is that both concept occurrence frequency and word’s sense number are taken into account. This similarity measurement more closely fits with human rating and effectively simulates human thinking process. Our experimental results on benchmark dataset M&C and R&G with Word Net2.1 as platform demonstrate roughly 0.9%–1.2%improvements over existing best approaches.

关键词： Word semantic similarity Concept semantic similarity Semantic similarity Hyponymy graph model Word Net.

来源：评论

学校读者我要写书评

暂无评论

Dilated Convolutional Pixels Affinity Network for Weakly Supervised Semantic Segmentation

引用

Chinese Journal of Electronics 2021年第6期30卷 1120-1130页

作者： ZHANG Zhe WANG Bilin YU Zhezhou LI Zhiyuan College of Computer Science and Technology Jilin University Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry

This paper studies semantic segmentation primarily under image-level weak-supervision. Most stateof-the-art technologies have recently used deep classification networks to create small and sparse discriminatory seed regions of each interest target as pseudo-labels for training segmentation networks, which achieve inferior performance compared with the fully supervised *** propose a Dilated convolutional pixels affinity network(DCPAN) to localize and expand the seed regions of objects to bridge this gap. Although introduced dilated convolutional units enable capture of additional location information of objects, it falsely highlighted true negative regions as dilated rate enlarge. To address this problem,we properly integrate dilated convolutional units with different dilated rates and self-attention mechanisms to obtain pixel affinity measure matrix for promoting classification network to generate high-quality object seed regions as pseudo-labels; thus, the performance of the segmentation network is boosted. Furthermore,although our approach seems simple, our method obtains a competitive performance, and experiments show that the performance of DCPAN outperforms other state-ofart approaches in weakly-supervised settings, which only use image-level labels on the Pascal VOC 2012 dataset.

关键词： weakly supervised semantic segmentation pseudolabels deep classification networks high-quality object seed regions pattern classification image segmentation weakly-supervised settings dilated convolutional pixels affinity network image-level weak-supervision image classification DCPAN self-attention mechanism object recognition feature extraction object detection sparse discriminatory seed regions pixel affinity measure matrix Pascal VOC 2012 dataset

来源：评论

学校读者我要写书评

暂无评论

Interactive Activity Learning from Trajectories with Qualitative Spatio-Temporal Relation

引用

Chinese Journal of Electronics 2015年第3期24卷 508-512页

作者： WANG Shengsheng WEN Changji LAI Yong LIU Yiting LIU Dayou College of Computer Science and Technology Key Laboratory of Symbolic Computing and Knowledge Engineering of Ministry of Education Jilin University

Automatically analyzing interactions from video has gained much attention in recent years. Here a novel method has been proposed for analyzing interactions between two agents based on the tra jectories. Previous works related to this topic are methods based on features, since they only extract features from objects. A method based on qualitative spatio-temporal relations is adopted which utilizes knowledge of the model(qualitative spatio-temporal relation calculi) instead of the original tra jectory information. Based on the previous qualitative spatio-temporal relation works, such as Qualitative tra jectory calculus(QTC), some new calculi are now proposed for long term and complex interactions. By the experiments, the results showed that our proposed calculi are very useful for representing interactions and improved the interaction learning more effectively.

关键词： Interactive activity learning Tra jectory pair Qualitative spatio-temporal relation

来源：评论

学校读者我要写书评

暂无评论

SPHLU:An Efficient Algorithm for Processing PRkNN Queries on Uncertain data

引用

Chinese Journal of Electronics 2016年第3期25卷 403-406页

作者： WANG Shengsheng LI Yang CHAI Sheng BOLOU Bolou Dickson College of Computer Science and Technology Key Laboratory of Symbolic Computing and Knowledge Engineering of Ministry of EducationJilin University

Query on uncertain data has received much attention in recent years, especially with the development of Location-based services(LBS). Little research is focused on reverse k nearest neighbor queries on uncertain data. We study the Probabilistic reverse k nearest neighbor(PRkN N) queries on uncertain data. It is succinctly shown that, PRkN N query retrieves all the points that have higher probabilities than a given threshold value to be the Reverse k-nearest neighbor(RkN N) of query data *** previous works on this topic mostly process with k > *** algorithms allow the cases for k > 1, but the efficiency is inefficient especially for large k. We propose an efficient pruning algorithm — Spatial pruning heuristic with louer and upper bound(SPHLU) for solving the PRkN N queries for k > 1. The experimental results demonstrate that our algorithm is even more efficient than the existent algorithms especial for a large value of k.

关键词： Spatial database Uncertain data R-tree Probabilistic reverse k nearest neighbor queries

来源：评论

学校读者我要写书评

暂无评论

A Triangular Stable Node Network based on Self-supervised Learning for personalized prediction

A Triangular Stable Node Network based on Self-supervised Le...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Liu, Qing Gao, Qian Fan, Jun Zhang, Zhiqiang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Jinan250014 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology Shandong Academy of Sciences Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd. No.1999 Shunhua road Shandong Jinan250101 China

ISBN: (纸本)9798350368741

In recent years, research has illuminated the potency of implicit data processing in enhancing user preferences. Nevertheless, barriers remain in breaking through the constraints of implicit information. This study aims to bridge this gap by firstly constructing a triangular stable node network model, tailored to manage implicit information with precision. Recognizing the challenge of pinpointing novel structures within large-scale graphs, we propose SLTSNN-a triangular stable node network based on self-supervised learning for personalized prediction. SLTSNN innovates by maximizing mutual information between graph-level and patch-level representations, while augmenting graph representations through extended enhanced representations. Additionally, it incorporates triangular data associations and introduces a triangular allocation attention network, which emphasizes strongly correlated preference features among similar users. Furthermore, SLTSNN employs contrastive learning to maximize mutual information between graph vectors and hidden representations, distinguishing between high-order global and local representations. The model's effectiveness in enhancing user preferences and capturing new graph structures is evidenced by its performance on hit rate and normalized discounted cumulative gain metrics across three datasets. © 2025 IEEE.

关键词： graph contrastive learning graph neural networks recommender systems self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

2DCMA： An Effective Maintenance Algorithm of Materialized Views in Peer data Management Systems

引用

Journal of Computer Science & Technology 2006年第4期21卷 503-512页

作者：覃飙王珊杜小勇 School of Information Renmin University of China Beijing 100872 P.R. China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 P.R. China

Update management is very important for data integration systems. So update management in peer data management systems （PDMSs） is a hot research area. This paper researches on view maintenance in PDMSs. First, the definition of view is extended and the peer view, local view and global view are proposed according to the requirements of applications. There are two main factors to influence materialized views in PDMSs. One is that schema mappings between peers are changed, and the other is that peers update their data. Based on the requirements, this paper proposes an algorithm called 2DCMA, which includes two sub-algorithms： data and definition consistency maintenance algorithm% to effectively maintain views. For data consistency maintenance, Mork＇s rules are extended for governing the use of updategrams and boosters. The new rule system can be used to optimize the execution plan. And are extended for the data consistency maintenance algorithm is based on the new rule system. Furthermore, an ECA rule is adopted for definition consistency maintenance. Finally, extensive simulation experiments are conducted in SPDMS. The simulation results show that the 2DCMA algorithm has better performance than that of Mork＇s when maintaining data consistency. And the 2DCMA algorithm has better performance than that of centralized view maintenance algorithm when maintaining definition consistency.

关键词： view maintenance peer data management system schema mapping ECA rule

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Cross-Modal Fusion Based Refinement for Text-to-Image Synthesis

引用

Chinese Journal of Electronics 2023年第6期32卷 1329-1340页

作者： SUN Haoran WANG Yang LIU Haipeng QIAN Biao Department of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of EducationHefei University of Technology

Text-to-image synthesis refers to generating visual-realistic and semantically consistent images from given textual descriptions. Previous approaches generate an initial low-resolution image and then refine it to be high-resolution. Despite the remarkable progress, these methods are limited in fully utilizing the given texts and could generate text-mismatched images, especially when the text description is complex. We propose a novel finegrained text-image fusion based generative adversarial networks(FF-GAN), which consists of two modules: Finegrained text-image fusion block(FF-Block) and global semantic refinement(GSR). The proposed FF-Block integrates an attention block and several convolution layers to effectively fuse the fine-grained word-context features into the corresponding visual features, in which the text information is fully used to refine the initial image with more details. And the GSR is proposed to improve the global semantic consistency between linguistic and visual features during the refinement process. Extensive experiments on CUB-200 and COCO datasets demonstrate the superiority of FF-GAN over other state-of-the-art approaches in generating images with semantic consistency to the given texts.

关键词： Visualization Fuses Convolution Semantics Linguistics Benchmark testing Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Safe Reinforcement Learning for Social Motor Coordination in Two Dimensional Space

Safe Reinforcement Learning for Social Motor Coordination in...

引用

26th International Conference on Industrial Technology, ICIT 2025

作者： Yang, Fan Huang, Yuening Zhai, Chao Zhang, Hehong China University of Geosciences School of Automation Wuhan Campus China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China Rice University George R. Brown School of Engineering and Computing HoustonTX United States Fuzhou University School of Computer and Data Science Fuzhou China

ISBN: (纸本)9798331521950

This paper presents an interactive motion control method based on reinforcement learning, designed to assist children with autism who have social motor impairments through a mirror game intervention. The virtual teacher uses the Deep Deterministic Policy Gradient (DDPG) algorithm to optimize its actions, guiding the participant to follow a Lissajous trajectory. To ensure safety, a motion-correction mechanism was developed, which automatically adjusts actions when the predicted trajectory surpasses predefined safety boundaries. The reward function considers both the distance between the virtual teacher and the target trajectory, as well as the distance between the virtual teacher and the participant, with dynamic adjustments applied by the motion-correction mechanism. Experimental results demonstrate that the virtual teacher effectively guides the participant towards the target trajectory while adhering to safety constraints. © 2025 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

St-Kan-Former: A Novel Spatiotemporal Transformer Neural Network for Air Quality Prediction

SSRN

引用

SSRN 2025年

作者： Zhang, Wenyong Xia, Dawen Chang, Guoyan Zheng, Zhiquan Hu, Yang Huo, Yujia Wang, Ziqiang Feng, Fujian Li, Yantao Li, Huaqing College of Data Science and Information Engineering Guizhou Minzu University Guiyang550025 China School of Computer Science and Engineering South China University of Technology Guangzhou510006 China Engineering Research Center of Micro-nano and Intelligent Manufacturing Ministry of Education Kaili University Kaili556011 China Affiliated Hospital of Guizhou Medical University Guiyang550001 China State Key Laboratory of Public Big Data Guizhou University Guiyang550008 China College of Computer Science Chongqing University Chongqing400044 China College of Electronic and Information Engineering Southwest University Chongqing400715 China

Accurate and timely air quality prediction is important for supporting daily activities and safeguarding respiratory health. However, the complex aerodynamic properties of air pollutants pose significant challenges to accurate air quality prediction. Most existing spatiotemporal prediction models extract spatial features in a coarse-grained manner, which cannot fully utilize the spatial feature data, resulting in poor prediction accuracy. To this end, we propose a novel air quality prediction method based on a Spatiotemporal Transformer with a Kolmogorov-Arnold Network (ST-KAN-Former). Specifically, in the temporal dimension, we use the wavelet transform, KAN, and ProbAttention network to construct the temporal feature extraction model. Based on this, the temporal dimension data are decomposed into high-frequency and low-frequency components, and then feature extraction is performed for fine-grained acquisition of temporal dimension features. Then, in the spatial dimension, we divide the spatial region into four subregions according to the distance parameter between the master site and the slave site and build a spatial feature extraction model for each subregion using KAN and ProbAttention networks. Next, we simulate the attenuation of pollutants during their dispersion to introduce the concept of diffusion coefficients. This approach allows us to apply diffusion processing to data from each subregion, enabling a finer granularity in capturing spatial characteristics. Finally, we employ the KAN and ProbAttention networks to construct a spatiotemporal feature fusion model that integrates temporal and spatial characteristics. Extensive experiments on the Beijing dataset demonstrate that ST-KAN-Former achieves better results compared with the other 11 benchmarks. © 2025, The Authors. All rights reserved.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

STGAN: Spatial-temporal Graph Autoregression Network for Pavement Distress Deterioration Prediction

arXiv

引用

arXiv 2025年

作者： Tong, Shilin Wu, Difei Liu, Xiaona Zheng, Le Du, Yuchuan Zou, Difan Department of Computer Science The University of Hong Kong Hong Kong Key Laboratory of Road and Traffic Engineering of the Ministry of Education Tongji University China Institute of IoT Shenzhen Polytechnic University China School of Information and Electronics Beijing Institute of Technology China Department of Computer Science Insitute of Data Science The University of Hong Kong Hong Kong

Pavement distress, manifested as cracks, potholes, and rutting, significantly compromises road integrity and poses risks to drivers. Accurate prediction of pavement distress deterioration is essential for effective road management, cost reduction in maintenance, and improvement of traffic safety. However, real-world data on pavement distress is usually collected irregularly, resulting in uneven, asynchronous, and sparse spatial-temporal datasets. This hinders the application of existing spatial-temporal models, such as DCRNN [1], since they are only applicable to regularly and synchronously collected data. To overcome these challenges, we propose the Spatial-Temporal Graph Autoregression Network (STGAN), a novel graph neural network (GNN) model designed for accurately predicting irregular pavement distress deterioration using complex spatial-temporal data. Specifically, STGAN integrates the temporal domain into the spatial domain, creating a larger graph where nodes are represented by spatial-temporal tuples and edges are formed based on a similarity-based connection mechanism. Furthermore, based on the constructed spatiotemporal graph, we formulate pavement distress deterioration prediction as a graph autoregression task, i.e., the graph size increases incrementally and the prediction is performed sequentially. This is accomplished by a novel spatial-temporal attention mechanism deployed by the proposed STGAN model. Utilizing the ConTrack dataset [2], which contains pavement distress records collected from different locations in Shanghai, we demonstrate the superior performance of STGAN in capturing spatial-temporal correlations and addressing the aforementioned challenges. Experimental results further show that STGAN outperforms baseline models, and ablation studies confirm the effectiveness of its novel modules. Our findings contribute to promoting proactive road maintenance decision-making and ultimately enhancing road safety and resilience. © 2025, CC BY.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：