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

IEEE International Conference on data Mining (ICDM)

作者： Xiaoyu Zhu Chenyang Bu Bingbing Dong Shengwei Ji Yi He Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology China School of Artificial Intelligence and Big Data Hefei University China Department of Computer Science Old Dominion University USA Research Center for Knowledge Engineering Zhejiang Lab China

Point-of-Interest (POI) recommendation, pivotal for guiding users to their next interested locale, grapples with the persistent challenge of data sparsity. Whereas knowledge graphs (KGs) have emerged as a favored tool to mitigate the issue, existing KG-based methods tend to overlook two crucial elements: the intention steering users’ location choices and the high-order topological structure within the KG. In this paper, we craft an Intention-aware knowledge Graph (IKG) that harmonizes users’ visit histories, movement trajectories, and location categories to model user intentions. Building upon IKG, our novel Intention-aware knowledge Graph Network (IKGN) delves deeper into the POI recommendation by weighing and propagating node embeddings through an attention mechanism, capturing the unique locational intent of each user. A sequential model like GRU is then employed to ensure a comprehensive representation of users’ short- and long-term location preferences. An empirical study on two real-world datasets validates the effectiveness of our proposed IKGN, with it markedly outshining seven benchmark rival models in both Recall and NDCG metrics. The code of IKGN is available at https://***/Jungle123456/IKGN.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Autonomous Human-Robot Collaborative Assembly Method Driven by the Fusion of Large Language Model and Digital Twin

Autonomous Human-Robot Collaborative Assembly Method Driven ...

引用

2024 International Conference on Intelligent Systems and Robotics, CISR 2024

作者： Chen, Jianpeng Luo, Haiwei Huang, Sihan Zhang, Meidi Wang, Guoxin Yan, Yan Jing, Shikai School of Mechanical Engineering Beijing Institute of Technology Beijing100081 China Capital Aerospace Machinery Corporation Limited Beijing100076 China Key Laboratory of Industry Knowledge & Data Fusion Technology and Application Ministry of Industry and Information Technology Beijing Institute of Technology Beijing100081 China China North Artificial Intelligence & Innovation Research Institute Beijing100071 China

Human-robot collaboration (HRC) plays an important role in human-centric manufacturing, which requires cooperative robots to have the ability of collaborate with human autonomously. It is very complex to understand the intention of human during the assembly process, therefore, we proposed a method of autonomous HRC assembly driven by the fusion of large language model (LLM) and digital twin in this paper. The assembly state is recognized from two perspectives, including the perception of key parts based on transfer learning and YOLO, and perceive operator actions based on LSTM and attention mechanism. In order to improve the autonomy of HRC, a collaborative task decision method driven by fine-tuning LLM based on assembly domain knowledge is proposed. A case study of reducer assembly is presented to verify the effectiveness of the proposed method. © Published under licence by IOP Publishing Ltd.

关键词： Collaborative robots

来源：评论

学校读者我要写书评

暂无评论

Multi-Label classification with Missing Labels by Preserving Feature-Label Space Consistency

Multi-Label classification with Missing Labels by Preserving...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Zan Zhang Depeng Zhang Gongqing Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Multi-label classification deals with the problem where an instance is associated with multiple labels simultaneously. Most existing multi-label classification algorithms assume that the labels of the training data are complete. However, we can obtain only a partial label set of each instance in some real applications since labelling data is difficult or costly. Some existing works on multi-label classification with missing labels focus on exploiting label correlations to complete the original label space and simultaneously build a multi-label learning model using label specific features. However, these methods may be suboptimal since they do not preserve feature-label space consistency. In this paper, we propose a Space Consistency-based Multi-Label classification algorithm named SCML to address this issue. First, label correlation in label space is learned to augment the incomplete original label matrix to a new supplementary label matrix, and the multi-label classifier is constructed simultaneously based on the new supplementary label matrix. Then, correlation information in feature space is learned based on the probabilistic neighborhood similarities to preserve feature-label space consistency. Moreover, the proposed algorithm has an effective mechanism for learning label-specific features to improve the multi-label classification with missing labels. Extensive experiments on twelve benchmark data sets validate the effectiveness of the proposed approach for improving the generalization performance of state-of-the-art algorithms of multi-label learning with missing labels.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FOSS: A Self-Learned Doctor for Query Optimizer

arXiv

引用

arXiv 2023年

作者： Zhong, Kai Sun, Luming Ji, Tao Li, Cuiping Chen, Hong Renmin University of China China Key Laboratory of Data Engineering and Knowledge Engineering MOE China Engineering Research Center of Database and Business Intelligence MOE China Shanghai Yunxi Technology Co. Ltd. China

Various works have utilized deep learning to address the query optimization problem in database system. They either learn to construct plans from scratch in a bottom-up manner or steer the plan generation behavior of traditional optimizer using hints. While these methods have achieved some success, they face challenges in either low training efficiency or limited plan search space. To address these challenges, we introduce FOSS, a novel framework for query optimization based on deep reinforcement learning. FOSS initiates optimization from the original plan generated by a traditional optimizer and incrementally refines suboptimal nodes of the plan through a sequence of actions. Additionally, we devise an asymmetric advantage model to evaluate the advantage between two plans. We integrate it with a traditional optimizer to form a simulated environment. Leveraging this simulated environment, FOSS can bootstrap itself to rapidly generate a large amount of high-quality simulated experiences. FOSS then learns from these experiences to improve its optimization capability. We evaluate the performance of FOSS on Join Order Benchmark, TPC-DS, and Stack Overflow. The experimental results demonstrate that FOSS outperforms the state-of-the-art methods in terms of latency performance. Compared to PostgreSQL, FOSS achieves speedup ranging from 1.15x to 8.33x in total latency across different benchmarks. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Review of graph construction and graph learning in stock price prediction 9th

Review of graph construction and graph learning in stock pri...

引用

9th International Conference on Information Technology and Quantitative Management, ITQM 2022

作者： Wang, Yunong Qu, Yi Chen, Zhensong Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China School of Management and Engineering Capital University of Economics and Business Beijing100070 China

Precise prediction of stock prices leads to more profits and more effective risk prevention, which is of great significance to both investors and regulators. Recent years, various kinds of information not directly-relevant with stock prices have received more attention, such as texts, images or connections. These external information has the potential of reflecting or influencing fluctuations, and thus, given the utilization of advanced analyzing techniques, the forecasting performance of stock prices could be promoted substantially. For instance, graph neural network models have expanded into many other disciplines including stock price prediction, and exhibited impressive representation learning ability. However, in stock markets, well-defined graphs are rarely seen and how to formulate the graph structures needed remains a challenging problem. Towards this end, this article presents a comprehensive overview of graph construction and graph learning in stock price prediction, by reviewing the existing studies, summarizing its general paradigm, special cases and proposing possible prospects. Our research not only systematically reveals the feasible ways of constructing graphs in financial markets, but also provides insights for further implementations of graph learning models into stock prediction tasks. © 2022 The Authors. Published by Elsevier B.V.

关键词： Financial markets

来源：评论

学校读者我要写书评

暂无评论

Exploring Heterogeneity and Uncertainty for Graph-based Cognitive Diagnosis Models in Intelligent Education

arXiv

引用

arXiv 2024年

作者： Shao, Pengyang Yang, Yonghui Gao, Chen Chen, Lei Zhang, Kun Zhuang, Chenyi Wu, Le Li, Yong Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Anhui Hefei China BNRist Tsinghua University Beijing China Department of Electronic Engineering BNRist Tsinghua University Beijing China Ant Group Zhejiang Hangzhou China

Graph-based Cognitive Diagnosis (CD) has attracted much research interest due to its strong ability on inferring students’ proficiency levels on knowledge concepts. While graph-based CD models have demonstrated remarkable performance, we contend that they still cannot achieve optimal performance due to the neglect of edge heterogeneity and uncertainty. Edges involve both correct and incorrect response logs, indicating heterogeneity. Meanwhile, a response log can have uncertain semantic meanings, e.g., a correct log can indicate true mastery or fortunate guessing, and a wrong log can indicate a lack of understanding or a careless mistake. In this paper, we propose an Informative Semantic-aware Graph-based Cognitive Diagnosis model (ISG-CD), which focuses on how to utilize the heterogeneous graph in CD and minimize effects of uncertain edges. Specifically, to explore heterogeneity, we propose a semantic-aware graph neural networks based CD model. To minimize effects of edge uncertainty, we propose an Informative Edge Differentiation layer from an information bottleneck perspective, which suggests keeping a minimal yet sufficient reliable graph for CD in an unsupervised way. We formulate this process as maximizing mutual information between the reliable graph and response logs, while minimizing mutual information between the reliable graph and the original graph. After that, we prove that mutual information maximization can be theoretically converted to the classic binary cross entropy loss function, while minimizing mutual information can be realized by the Hilbert-Schmidt Independence Criterion. Finally, we adopt an alternating training strategy for optimizing learnable parameters of both the semantic-aware graph neural networks based CD model and the edge differentiation layer. Extensive experiments on three real-world datasets have demonstrated the effectiveness of ISG-CD. © 2024, CC BY.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

ReconBoost: Boosting Can Achieve Modality Reconcilement 41

ReconBoost: Boosting Can Achieve Modality Reconcilement

引用

41st International Conference on Machine Learning, ICML 2024

作者： Hua, Cong Xu, Qianqian Bao, Shilong Yang, Zhiyong Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Distilling Dynamic Spatial Relation Network for Human Pose Estimation 32

Distilling Dynamic Spatial Relation Network for Human Pose E...

引用

32nd British Machine Vision Conference, BMVC 2021

作者： Wu, Kewei Wang, Tao Xie, Zhao Guo, Dan Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Human pose estimation is a challenging task that requires the comprehension of the pose structure. This work can refer to spatial relation inference in a pose structure model;how to model the dynamic spatial relation against various unreliable joints is critical. To this end, we propose a Distilling Dynamic Spatial Relation network (DDSR), which builds pose-based graph representation by exploiting the feature of spatial relation from the location distribution of joints. We use a dynamic message propagation mechanism to update the spatial relation on edges. Specifically, to filter out the noisy predictions, we select the joints with high confidence;to enhance the spatial relation in a large receptive field, we propagate multi-stage messages among joints. Besides, to reduce the computation cost of the multi-stage message propagation, we design a cross-resolution distillation framework. We use a new spatial distillation loss to verify the spatial relation between the teacher model and the student model. Experimental results on COCO and MPII datasets show that our method is superior to the state-of-the-art methods. The visualization results further verify the interpretability of our spatial relation. © 2021. The copyright of this document resides with its authors.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

A Semantic Framework for Chinese Historical Events Based on Linked data and knowledge Graph 16th

A Semantic Framework for Chinese Historical Events Based on ...

引用

16th International Conference on Diversity, Divergence, Dialogue, iConference 2021

作者： Wang, Hao Li, Yueyan Deng, Sanhong School of Information Management Nanjing University Nanjing210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing210023 China

ISBN: (纸本)9783030712914

In the era of big data, data redundancy has become an obstacle to deep reading. The objective of linked data as a new data organization model is to transform data into structured data following unified standards. The lack of Chinese conceptual terms has seriously hindered the semantization and standardization of Chinese domain ontology. Taking Chinese historical events as an example, ontology technology is used in this paper to standardize the definition of concepts and semantic relations in domain knowledge. Moreover, concepts from text resources are extracted through a deep learning algorithm Bi-LSTM-CRFs and combined with an external knowledge base to realize the fusion of related data within various data sets. Ultimately, the knowledge ontology of historical events is displayed in the way of a knowledge graph to further explore the practical application. The results show that the accuracy of the terms extraction of historical events is about 80% indicating the good recognition performance and portability of the model. © 2021, Springer Nature Switzerland AG.

关键词： Linked data

来源：评论

学校读者我要写书评

暂无评论

EvoChart: A Benchmark and a Self-Training Approach Towards Real-World Chart Understanding

arXiv

引用

arXiv 2024年

作者： Huang, Muye Lai, Han Zhang, Xinyu Wu, Wenjun Ma, Jie Zhang, Lingling Liu, Jun School of Computer Science and Technology Xi’an Jiaotong University China MOE KLINNS Lab Xi’an Jiaotong University China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering China

Chart understanding enables automated data analysis for humans, which requires models to achieve highly accurate visual comprehension. While existing Visual Language Models (VLMs) have shown progress in chart understanding, the lack of high-quality training data and comprehensive evaluation benchmarks hinders VLM chart comprehension. In this paper, we introduce EvoChart, a novel self-training method for generating synthetic chart data to enhance VLMs’ capabilities in real-world chart comprehension. We also propose EvoChart-QA, a noval benchmark for measuring models’ chart comprehension abilities in real-world scenarios. Specifically, EvoChart is a unique self-training data synthesis approach that simultaneously produces high-quality training corpus and a high-performance chart understanding model. EvoChart-QA consists of 650 distinct real-world charts collected from 140 different websites and 1,250 expert-curated questions that focus on chart understanding. Experimental results on various open-source and proprietary VLMs tested on EvoChart-QA demonstrate that even the best proprietary model, GPT-4o, achieves only 49.8% accuracy. Moreover, the EvoChart method significantly boosts the performance of open-source VLMs on real-world chart understanding tasks, achieving 54.2% accuracy on EvoChart-QA. © 2024, CC BY.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：