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

Who knows more? The role of structural hole spanners in accurate information identification on social media

Pacific-Basin Finance Journal 2025年

作者： Man Guo Wen Long Yanqiang Zhong Wei Zhang School of Economics and Management University of Chinese Academy of Sciences Beijing 100190 PR China Research Center on Fictitious Economy & Data Science Chinese Academy of Sciences Beijing 100190 PR China Key Laboratory of Big Data Mining & Knowledge Management Chinese Academy of Sciences Beijing 100190 PR China Department of Information Systems and Management Engineering Southern University of Science and Technology Shenzhen 518055 PR China

Based on structural hole theory, this study explores the differences in the ability of Chinese social media users with different characteristics to provide accurate information. Using over 20 million interactive data from 2.19 million users, we construct a social network and identify structural hole spanners and ordinary users. As key players in a network, structural hole spanners are typically located at the intersections of different groups or information sources. They differ from ordinary users in the way they gather and disseminate information. The empirical results indicate that the accuracy of market judgements by structural hole spanners is at least 12.38 % higher than that of ordinary users. Strategy simulations show that using information from structural hole spanners to make investment decisions can achieve a 116 % cumulative return during the backtesting period, nearly four times that of ordinary users. This information advantage occurs primarily because opinion distance and information uniqueness play significant roles in improving information accuracy. This study not only helps deepen understanding of information dissemination characteristics among heterogeneous users on social media but also provides empirical support for the application of structural hole theory in finance, with important theoretical and practical implications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

knowledge Enhanced Coreference Resolution via Gated Attention

Knowledge Enhanced Coreference Resolution via Gated Attentio...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： He, Kai Mao, Bing Zhou, Xiangyu Li, Yufei Gong, Tieliang Li, Chen Wu, Jialun Xi'an Jiaotong University School of Computer Science and Technology Xi'an China Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an China

ISBN: (纸本)9781665468190

Coreference resolution aims at linking all mentions that refer to the same entity, which are widely adopted in many biomedical and bioinformatics tasks, such as biomedical knowledge graph construction and metabolic pathway integration. Many recent studies focus on improving neural model structures. However, we argue that a practical method that integrates commonsense knowledge can further improve coreference resolution performance, because commonsense delivers extra prior knowledge for reasoning and can enhance related representations, rather than naive mention-context occurrence modeling. In this work, we propose an effective method to integrate external commonsense knowledge into a neural coreference resolution model. Specially, a gated attention mechanism is employed in our method to leverage commonsense according to different contexts. By using ConceptNet as the knowledge base in three span-ranking backbone models, the models can yield significant performance gains on used datasets. We also achieve improvements in tasks of long-term mention detection and cross-sentence coreferences after incorporating knowledge. © 2022 IEEE.

关键词： Model structures

来源：评论

学校读者我要写书评

暂无评论

Research and Implementation of Chinese Text Automatic Proofreading System 2

Research and Implementation of Chinese Text Automatic Proofr...

引用

2018 2nd Annual International Conference on Cloud Technology and Communication engineering, CTCE 2018

作者： Gong, Yonggang Fu, Junying Lian, Xiaoqin Li, Yuying Beijing Key Laboratory of Big Data Technology for Food Safety School of Computer and Information Engineering Beijing Technology and Business University Beijing100048 China

The news media platform has a huge amount of original news releases every day, it is impractical to use manual review of text typos. This paper designed and implemented a Chinese text automatic proofreading system for large-scale text content and high-speed processing. The proofreading content is first analyzed and classified: typos and sensitive information. Firstly, the system used the n-gram model to statistically analyze the corpus after segmentation to form a 2-gram model library and a contextual context library;secondly, builded a typo confusion set, and then calculated the probability of the target word in the knowledge base to realize automatic error detection and correction of Chinese text. The system has been successfully applied to the error of the content of many government news media platforms, each server can handle one million articles every day. The results show that the recall rate of the article is 78.9% and the accuracy rate is 85.1%. It meets the demand of high speed and accurate processing of massive text error, and has important practical significance and application fields. © Published under licence by IOP Publishing Ltd.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

A Survey of Literature Analysis Methods Based on Representation Learning 17th

A Survey of Literature Analysis Methods Based on Representat...

引用

17th Chinese Conference on Image and Graphics Technologies and Applications, IGTA 2022

作者： Zhang, Qinghui Chen, Yi Beijing Key Laboratory of Big Data Technology for Food Safety School of Computer Science and Engineering Beijing Technology and Business University Beijing100048 China

ISBN: (纸本)9789811950957

The analysis of massive scientific literature collections can help researchers capture potential knowledge, understand disciplinary insights, and discover opportunities for academic collaboration. However, the huge volume of literature data becomes a major problem for human analysis and computer processing, which prevents scholars from rapidly obtaining disciplinary knowledge. Representation learning methods can effectively handle large-scale text and graph data, which have excelled in literature analysis tasks. In this study, we introduce the types of literature data and several typical academic networks. Then, we review the representation learning models and classify these methods into (a) word representation learning-based, including word2vec, GloVe, ELMo, Bert, etc.;(b) graph representation learning-based, including matrix factorization-based, random walk-based and deep learning-based methods, such as DeepWalk, node2vec, GCN, etc. Finally, we discuss the opportunities and present three challenges of representation learning-based approaches for literature analysis. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

A frequency and two-hop configuration checking-driven local search algorithm for the minimum weakly connected dominating set problem

引用

Neural Computing and Applications 2024年第22期36卷 13833-13852页

作者： Li, Ruizhi He, Jintao Lin, Cuisong Liu, Ying Hu, Shuli Yin, Minghao Jilin University of Finance and Economics Changchun130117 China Northeast Normal University Changchun130117 China Business Big Data Research Center of Jilin Province Changchun130117 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

The minimum weakly connected dominating set problem is a typical NP-hard problem with a wide range of applications. To solve this problem, we propose a frequency property and two-hop configuration checking strategy-driven local search algorithm (FCC2LS). In this algorithm, we first propose a lock-vertex-based initial solution construction procedure. This procedure guarantees that certain vertices, which must be included in the optimal solution, are added to the solution. Second, we propose a two-hop configuration checking strategy and a frequency property. The two-hop configuration checking strategy is a new variant of the original configuration checking strategy, which prohibits vertices with unchanged configuration from being added to the candidate solution. The frequency property is used to record the number of times for each vertex is added to the solution, which can increase the diversity of selected vertices. Third, we combine two scoring functions, Dscore and Nscore, with the above strategies and propose effective vertex selection methods to help the algorithm select suitable vertices to add into or remove from the candidate solutions. Finally, we evaluate the proposed algorithm FCC2LS with four state-of-the-art algorithms on four groups of benchmark instances. Experimental results show that our algorithm performs better on four classical benchmark instances. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Interference and power constrained broadcast and multicast routing in wireless ad hoc networks using directional antennas

Interference and power constrained broadcast and multicast r...

引用

作者： Li, Zheng Li, Deying Liu, Ming School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 610054 China

In this paper, we address the interference and power constrained broadcast/multicast routing problem (D-IPCB/M) in wireless ad hoc networks using directional antenna as a starting point, which jointly considers low-interference and energy-efficiency issues. Then we study the delay-bounded interference and power constrained broadcast/multicast routing problem (DB-D-IPCB/M). An approximation algorithm and a heuristic algorithm with low time complexity are proposed for the D-IPCB/M and DB-D-IPCB/M problem, respectively. Finally, we explore and investigate the multi-constrained subgraph optimization (MCSO) problem. We prove its NP-hard and propose an approximation scheme with theoretical performance guarantee for this class of optimization problems. This is a general result originated from the study of D-IPCB/M and DB-D-IPCB/M problems, which can be applicable to solve different optimization problems such as the multi-constrained broadcast/multicast routing problems. Broadcast/multicast message by using the routing trees found by our algorithms tends to not only have less channel collisions but also save energy to extend network lifetime. The theoretical results are evaluated by simulation studies. © 2010 Elsevier B.V. All rights reserved.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Improved image captioning with subword units training and transformer

引用

High Technology Letters 2020年第2期26卷 211-216页

作者： Cai Qiang Li Jing Li Haisheng Zuo Min School of Computer and Information Engineering Beijing Techology and Business UniversityBeijing 100048P.R.China Beijing Key Laboratory of Big Data Technology for Food Safety Beijing 100048P.R.China National Engineering Laboratory for Agri-Product Quality Traceability Beijing 100048P.R.China

Image captioning models typically operate with a fixed vocabulary,but captioning is an open-vocabulary *** work addresses the image captioning of out-of-vocabulary words by labeling it as unknown in a *** addition,recurrent neural network(RNN)and its variants used in the caption task have become a bottleneck for their generation quality and training time *** address these 2 essential problems,a simpler but more effective approach is proposed for generating open-vocabulary caption,long short-term memory(LSTM)unit is replaced with transformer as decoder for better caption quality and less training *** effectiveness of different word segmentation vocabulary and generation improvement of transformer over LSTM is discussed and it is proved that the improved models achieve state-of-the-art performance for the MSCOCO2014 image captioning tasks over a back-off dictionary baseline model.

关键词： image captioning transformer byte pair encoding(BPE) reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

The Research on the Algorithms of keyword Search in Relational database

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2008年 4977卷 134-143页

作者： Li, Peng Zhu, Qing Wang, Shan Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing100872 China

ISBN: (纸本)354089375X

With the development of relational database, people require better database not only in the aspect of database performance, but also in the aspect of the database’s interactive ability. So that the database is much more friendly than just before and it is possible for a common user who do not have any special knowledge on database can access the database, without knowing the schema of database and writing intricate SQL. For the reason that the information retrieval on the web has developed well to some extent, when we develop the technology of keyword search in relational database, we can draw some ideas from information retrieve. But the great differences between the text database on the web and the relational database also bring some new challenges: 1) The answer needed by user is not only one tuple in database, but the tuple sets consisting of the tuple connect from different table using the "primary key-foreign key" relationship. 2)The results of the evaluation criteria is more important, because it is directly related to the effectiveness of Search System. 3)The structure of relational database is much more intricate than text database, and the algorithms of information retrieval are not fit the relational database. So in this paper, we introduce a novel keyword search algorithm and a modified criteria of evaluating answers in order to enhance efficiency of the keyword search and return much more effective information to users, finally, the search algorithm’s performance is tested and evaluated. © Springer-Verlag Berlin Heidelberg 2008

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Deployment optimization for target perpetual coverage in energy harvesting wireless sensor network

引用

Digital Communications and Networks 2024年第2期10卷 498-508页

作者： Zhenkun Jin Yixuan Geng Chenlu Zhu Yunzhi Xia Xianjun Deng Lingzhi Yi Xianlan Wang Wuhan Business University 430056China Wuhan Research Institute of Post and Telecommunication Wuhan430074China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data SecuritySchool of Cyber Science and EngineeringHuazhong University of Science and TechnologyWuhan430074China Hubei Chutian Expressway Digital Technology Co.Ltd Wuhan430074China School of Information and Safety Engineering Zhongnan University of Economics and LawWuhan430073China

Energy limitation of traditional Wireless Sensor Networks(WSNs)greatly confines the network lifetime due to generating and processing massive sensing data with a limited *** energy harvesting WSN is a novel network architecture to address the limitation of traditional ***,existing coverage and deployment schemes neglect the environmental correlation of sensor nodes and external energy with respect to physical *** considering the spatial correlation of the environment and the uneven distribution of energy in energy harvesting WSN,we investigate how to deploy a collection of sensor nodes to save the deployment cost while ensuring the target perpetual *** Confident Information Coverage(CIC)model is adopted to formulate the CIC Minimum Deployment Cost Target Perpetual Coverage(CICMTP)problem to minimize the deployed sensor *** the CICMTP is NP-hard,we devise two approximation algorithms named Local Greedy Threshold Algorithm based on CIC(LGTA-CIC)and Overall Greedy Search Algorithm based on CIC(OGSA-CIC).The LGTA-CIC has a low time complexity and the OGSA-CIC has a better approximation *** simulation results demonstrate that the OGSA-CIC is able to achieve lower deployment cost and the performance of the proposed algorithms outperforms GRNP,TPNP and EENP algorithms.

关键词： Energy harvesting WSN Deployment optimization Confident information coverage(CIC) Target perpetual coverage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：