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

HUSS:A Heuristic Method for Understanding the Semantic Structure of Spreadsheets

data Intelligence 2023年第3期5卷 537-559页

作者： Xindong Wu Hao Chen Chenyang Bu Shengwei Ji Zan Zhang Victor S.Sheng Key Laboratory of Knowledge Engineering with Big Data(the Ministry of Education of China) Hefei University of TechnologyChinaSchool of Computer Science and Information EngineeringHefei University of TechnologyHefeiChina Research Institute of Artificial Intelligence Zhejiang LabHangzhouChina Department of Computer Science Texas Tech UniversityLubbockTX 79409USA

Spreadsheets contain a lot of valuable data and have many practical *** key technology of these practical applications is how to make machines understand the semantic structure of spreadsheets,e.g.,identifying cell function types and discovering relationships between cell *** existing methods for understanding the semantic structure of spreadsheets do not make use of the semantic information of cells.A few studies do,but they ignore the layout structure information of spreadsheets,which affects the performance of cell function classification and the discovery of different relationship types of cell *** this paper,we propose a Heuristic algorithm for Understanding the Semantic Structure of spreadsheets(HUSS).Specifically,for improving the cell function classification,we propose an error correction mechanism(ECM)based on an existing cell function classification model[11]and the layout features of *** improving the table structure analysis,we propose five types of heuristic rules to extract four different types of cell pairs,based on the cell style and spatial location *** experimental results on five real-world datasets demonstrate that HUSS can effectively understand the semantic structure of spreadsheets and outperforms corresponding baselines.

关键词： Spreadsheet semantic structure Information extraction Heuristics Cell function analysis Table structure analysis

来源：评论

学校读者我要写书评

暂无评论

MatchPrompt: Prompt-based Open Relation Extraction with Semantic Consistency Guided Clustering

MatchPrompt: Prompt-based Open Relation Extraction with Sema...

引用

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Wang, Jiaxin Zhang, Lingling Liu, Jun Liang, Xi Zhong, Yujie Wu, Yaqiang Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University China Lenovo Research Beijing China

Relation clustering is a general approach for open relation extraction (OpenRE). Current methods have two major problems. One is that their good performance relies on large amounts of labeled and pre-defined relational instances for pre-training, which are costly to acquire in reality. The other is that they only focus on learning a high-dimensional metric space to measure the similarity of novel relations and ignore the specific relational representations of clusters. In this work, we propose a new prompt-based framework named MatchPrompt, which can realize OpenRE with efficient knowledge transfer from only a few predefined relational instances as well as mine the specific meanings for cluster interpretability. To our best knowledge, we are the first to introduce a prompt-based framework for unlabeled clustering. Experimental results on different datasets show that MatchPrompt achieves the new SOTA results for OpenRE. © 2022 Association for Computational Linguistics.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Multi-objective Reinforcement Learning - Concept, Approaches and Applications 10

Multi-objective Reinforcement Learning - Concept, Approaches...

引用

10th International Conference on Information Technology and Quantitative management, ITQM 2023

作者： Zhang, Linzi Qi, Zhiquan Shi, Yong School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China University of Birmingham Edgbaston BirminghamB15 2TT United Kingdom 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

Real-world decision-making tasks are generally complicated and require trade-offs between multiple, even conflicting, objectives. As the advent and great development of advanced information technology, it has evolved into using reinforcement learning (RL) algorithms to tackle the multi-objective decision making (MODM) problems. In this paper, we will first identify the basic concepts and factors when modelling the MODM tasks with reinforcement learning, and then review the traditional RL, such as Sarsa, Q-Learning, Policy Gradients, Actor-Critic, Monte-Carlo learning, and modern deep RL algorithms applied in this process. Furthermore, the specific practical scenarios described in MODM problems will be summarized through analyzing some typical articles. Finally, the future trends of multi-objective reinforcement learning will be discussed. © 2023 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (https://***/licenses/by-nc-nd/4.0) Peer-review under responsibility of the scientific committee of the Tenth International Conference on Information Technology and Quantitative management.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Automatic Fusion for Multimodal Entity Alignment: A New Perspective from Automatic Architecture Search

Automatic Fusion for Multimodal Entity Alignment: A New Pers...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Chenyang Bu Yunpeng Hong Shiji Zang Guojie Chang Xindong Wu Key Laboratory of Knowledge Engineering With Big Data (the Ministry of Education of China) School of Computer Science and Engineering HeFei University of Technology

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Integrating multimodal data from diverse sources is crucial for enhancing various applications. Multimodal entity alignment (MMEA), which discovers equivalent entities across different sources and modalities, aims to eliminate data silos for comprehensive integration. A key challenge in MMEA is effectively fusing vector representations from different modalities of the same entity for optimal entity matching. Existing fusion methods involve individual fusion operators (e.g., concatenation and summation) or the manual design of complex network structures, incurring significant human resource costs. In this paper, for the first time, we introduce the research question of automatic fusion for MMEA and propose an efficient approach from the perspective of automated architecture search. Experimental comparisons with state-of-the-art methods on real-world datasets demonstrate the effectiveness of the proposed approach.

关键词： Costs Search methods Complex networks Vectors

来源：评论

学校读者我要写书评

暂无评论

Interest Points Analysis for Internet Forum Based on Long-Short Windows Similarity

引用

Computers, Materials & Continua 2022年第8期72卷 3247-3267页

作者： Xinghai Ju Jicang Lu Xiangyang Luo Gang Zhou Shiyu Wang Shunhang Li Yang Yang State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001China School of Computing and Information Systems Singapore Management University188065Singapore College of Computer Science and Big Data Fuzhou UniversityFuzhou350116China

For Internet forum Points of Interest(PoI),existing analysis methods are usually lack of usability analysis under different conditions and ignore the long-term variation,which lead to blindness in method *** address this problem,this paper proposed a PoI variation prediction framework based on similarity analysis between long and short *** on the framework,this paper presented 5 PoI analysis algorithms which can be categorized into 2 types,i.e.,the traditional sequence analysis methods such as autoregressive integrated moving average model(ARIMA),support vector regressor(SVR),and the deep learning methods such as convolutional neural network(CNN),long-short term memory network(LSTM),Transformer(TRM).Specifically,this paper firstly divides observed data into long and short windows,and extracts key words as PoI of each ***,the PoI similarities between long and short windows are calculated for training and ***,series of experiments is conducted based on real Internet forum *** results show that,all the 5 algorithms could predict PoI variations well,which indicate effectiveness of the proposed *** the length of long window is small,traditional methods perform better,and SVR is the *** the contrary,the deep learning methods show superiority,and LSTM performs *** results could provide beneficial references for PoI variation analysis and prediction algorithms selection under different parameter configurations.

关键词： Point of interest(PoI)analysis long and short windows sequential analysis deep learning

来源：评论

学校读者我要写书评

暂无评论

Causal Interventional Training for Image Recognition

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2023年 25卷 1033-1044页

作者： Qin, Wei Zhang, Hanwang Hong, Richang Lim, Ee-Peng Sun, Qianru Hefei Univ Technol Key Lab Knowledge Engn Big Data Minist Educ Hefei 230006 Peoples R China Hefei Comprehens Natl Sci Ctr Inst Artificial Intelligence Hefei 230088 Peoples R China Nanyang Technol Univ Sch Comp Sci Singapore 639798 Singapore Singapore Management Univ Sch Informat Syst Singapore 178902 Singapore

Deep learning models often fit undesired dataset bias in training. In this paper, we formulate the bias using causal inference, which helps us uncover the ever-elusive causalities among the key factors in training, and thus pursue the desired causal effect without the bias. We start from revisiting the process of building a visual recognition system, and then propose a structural causal model (SCM) for the key variables involved in dataset collection and recognition model: object, common sense, bias, context, and label prediction. Based on the SCM, one can observe that there are "good " and "bad " biases. Intuitively, in the image where a car is driving on a high way in a desert, the "good " bias denoting the common-sense context is the highway, and the "bad " bias accounting for the noisy context factor is the desert. We tackle this problem with a novel causal interventional training (CIT) approach, where we control the observed context in each object class. We offer theoretical justifications for CIT and validate it with extensive classification experiments on CIFAR-10, CIFAR-100 and ImageNet, e.g., surpassing the standard deep neural networks ResNet-34 and ResNet-50, respectively, by 0.95% and 0.70% accuracies on the ImageNet. Our code is open-sourced on the GitHub https://***/qinwei-hfut/CIT.

关键词： Training Automobiles Task analysis Visualization Road transportation Image recognition data models Causality causal intervention deep learning imagenet image recognition

来源：评论

学校读者我要写书评

暂无评论

Improving graph neural network for session-based recommendation system via non-sequential interactions

引用

NEUROCOMPUTING 2022年 468卷 111-122页

作者： Gwadabe, Tajuddeen Rabiu Liu, Ying Univ Chinese Acad Sci Sch Comp Sci & Technol Beijing 101400 Peoples R China Chinese Acad Sci Data Min & High Performance Comp Lab Beijing 101400 Peoples R China Chinese Acad Sci Key Lab Big Data Min & Knowledge Management Beijing 100190 Peoples R China

In the absence of user profile information, recommender systems have to only rely on current session information for recommendation. E-commerce sites may use transitions between interactions in each session to improve recommendation. This situation is known as the session-based recommendation. It can be challenging due to the limited information and the uncertain user behavior. Recurrent Neural Networks (RNN) have become the state-of-the-art models for session-based recommendation due to their ability to model long sequences. Although powerful, RNN-based models suffer from learning complex transition between the interactions. To mitigate it, Graph Neural Networks (GNN) have been proposed for session-based recommendation. However, different sequences of interactions may lead to the same outcome especially on E-commerce sites, hence non-sequential interactions between items of the current session may improve the performance of a recommender system. To learn both the sequential and non-sequential transition interactions between the items in the current session, we proposed a GNN based model named GRASER. Specifically, the proposed model first learns the non-sequential and then the sequential transition interactions between the items of the current session using GNN in an end-to-end manner. Extensive experiments were carried out on two datasets: Yoochoose from the RecSys Challenge 2015 and Diginetica from CIKM Cup 2016. The results showed that the proposed model outperforms the other state-of-the-art models by 11% and 10% on MRR@20 on Yoochoose and Diginetica datasets respectively. (c) 2021 Elsevier B.V. All rights reserved.

关键词： Session-based recommendation Graph neural networks Sequential recommendation General interest

来源：评论

学校读者我要写书评

暂无评论

Unified Image Harmonization with Region Augmented Attention Normalization

引用

Annals of data Science 2024年第5期11卷 1865-1886页

作者： Hou, Junjie Zhang, Yuqi Su, Duo Sino-Danish College University of Chinese Academy of Sciences Zhongguancun East Rd Beijing100190 China School of Mathematical Sciences University of Chinese Academy of Sciences Zhongguancun East Rd Beijing100190 China School of Computer Science and Technology University of Chinese Academy of Sciences Zhongguancun East Rd Beijing100190 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Zhongguancun East Rd Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Zhongguancun East Rd Beijing100190 China

The image harmonization task endeavors to adjust foreground information within an image synthesis process to achieve visual consistency by leveraging background information. In academic research, this task conventionally involves the utilization of simple synthesized images and matching masks as inputs. However, obtaining precise masks for image harmonization in practical applications poses a significant challenge, thereby creating a notable disparity between research findings and real-world applicability. To mitigate this disparity, we propose a redefinition of the image harmonization task as "Unified Image Harmonization," where the input comprises only a single image, thereby enhancing its applicability in real-world scenarios. To address this challenge, we have developed a novel framework. Within this framework, we initially employ inharmonious region localization to detect the mask, which is subsequently utilized for harmonization tasks. The pivotal aspect of the harmonization process lies in normalization, which is accountable for information transfer. Nonetheless, the current background-to-foreground information transfer and guidance mechanisms are limited by single-layer guidance, thereby constraining their effectiveness. To overcome this limitation, we introduce Region Augmented Attention Normalization (RA2N), which enhances the attention mechanism for foreground feature alignment, consequently leading to improved alignment and transfer capabilities. Through qualitative and quantitative comparisons on the iHarmony4 dataset, our model exhibits exceptional performance not only in unified image harmonization but also in conventional image harmonization tasks. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs 39

CLDG: Contrastive Learning on Dynamic Graphs

引用

39th IEEE International Conference on data Engineering, ICDE 2023

作者： Xu, Yiming Shi, Bin Ma, Teng Dong, Bo Zhou, Haoyi Zheng, Qinghua Xi'an Jiaotong University Department of Computer Science and Technology China Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering China Xi'an Jiaotong University Department of Distance Education China Beihang University School of Software China Beihang University Advanced Innovation Center for Big Data and Brain Computing China

ISBN: (纸本)9798350322279

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph's augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG. © 2023 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：