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

International Conference on intelligent System and Knowledge Engineering, ISKE

作者： Yixiong Bian Huakang Li Jiangsu Key Lab of Big Data and Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China

With the rapid development of the internet, applications of recommendation systems for online shops and entertainment platforms become more and more popular. In order to improve the effectiveness of recommendation, external information has been incorporated into various algorithms, such as location and social relationship. However, most algorithms only focus on the introduction of external information without depth analysis of the intrinsic mechanism in the external information. This paper proposed a transfer model of social trusted relationship, and optimized the reliability of the transfer model using pruning algorithm based on original trust recommendation. A credible social relationship macro-transfer model based on iterations of new credible relationships is defined by the similarity of social relationships. With a certain interest topic as a source of information, a micro-transfer model achieves the theme of interest and credibility of the expansion using social information dissemination algorithm. To demonstrate the effectiveness of the macro and micro credible transfer models, we used the Mantra search tree pruning algorithm and the optimization algorithm of similar category replacing similar products. The experimental results show that the proposed method based on the macroscopic and microscopic transfer models of the trusted relationship enhances the success rate and stability of the recommended system.

关键词： Collaboration Reliability Social network services Heuristic algorithms Optimization System performance Convergence

来源：评论

学校读者我要写书评

暂无评论

SLBERT: An Improved FLAT-BERT for Named Entity Recognition

SSRN

引用

SSRN 2022年

作者： Fei, Yuefan Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Jiangsu Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Jiangsu Nanjing China

Named Entity Recognition (NER) aims to identify named entities mentioned in unstructured text and classify them into predefined named entity classes. Although models using word fusion have achieved relatively high performance, the recognition of ambiguous entities in text remains challenging, and the performance of the models depends on a sufficient amount of manually labeled data;exploring models that fuse more feature dimensions and schemes that fuse existing datasets is of farreaching interest. In this work, we propose an improved scheme of FLAT-BERT, SLBERT, that can be used in the field of named entity *** scheme consists of two phases that more fully exploit the global semantics of the text. In the first stage, the model is trained based on the current dataset, another dataset is predicted for cross-dataset fusion, and the correctness of label annotation is improved by entity confidence modeling. In the second stage, the global semantics of the text is extracted using Sentence BERT and embedded into the feature matrix encoded using Lattice BERT for subsequent Token classification. We have conducted experiments on several datasets, and the experimental results demonstrate the effectiveness of the proposed scheme in this paper. In terms of F1 values, compared with FLAT-BERT, the improvement is 0.15%, 0.34%, 0.61%, and 0.58% on datasets OntoNotes, MSRA, Resume, and Weibo, respectively. © 2022, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

ILAPF: INCREMENTAL LEARNING ASSISTED PARTICLE FILTERING

arXiv

引用

arXiv 2017年

作者： Liu, Bin School of Computer Science Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China

This paper is concerned with dynamic system state estimation based on a series of noisy measurement with the presence of outliers. An incremental learning assisted particle filtering (ILAPF) method is presented, which can learn the value range of outliers incrementally during the process of particle filtering. The learned range of outliers is then used to improve subsequent filtering of the future state. Convergence of the outlier range estimation procedure is indicated by extensive empirical simulations using a set of differing outlier distribution models. The validity of the ILAPF algorithm is evaluated by illustrative simulations, and the result shows that ILAPF is more accurate and faster than a recently published state-of-the-art robust particle filter. It also shows that the incremental learning property of the ILAPF algorithm provides an efficient way to implement transfer learning among related state filtering tasks. Copyright © 2017, The Authors. All rights reserved.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Using deep learning to recognize biomedical entities

Using deep learning to recognize biomedical entities

引用

International Conference on intelligent System and Knowledge Engineering, ISKE

作者： Xuemin Yang Zhifei Zhang Ronggen Yang Daoyu Huang Geng Yang Lejun Gong Jiangsu Key Laboratory of Big Data Security &Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China Faculty Intelligent Science and Control Engineering Jinling Institute of Technology Nanjing China

With the rapid growth of the high-throughput biological technology, it brings biomedical big omics' data containing literature and annotated data. Especially, a wealth of relevant information exists in various types of biomedical literature. Text mining has emerged as a potential solution to achieve knowledge for bridging between the free text and structured representation of biomedical information. In this work, we used deep learning to recognize biomedical entities. We obtained 84.0% precision, 69.5% recall, and 76.1% F-score aiming at the GENIA corpus, and obtained 91.3% precision, 91.1% recall, and 91.2% F-score aiming at the BioCreAtIvE II Gene Mention corpus. Experimental results show that our proposed approach is promising for developing biomedical text mining technology in biomedical entity recognition.

关键词： Machine learning Neural networks Text mining Dictionaries Distributed databases Biological system modeling Telecommunications

来源：评论

学校读者我要写书评

暂无评论

ILAPF: INCREMENTAL LEARNING ASSISTED PARTICLE FILTERING

ILAPF: INCREMENTAL LEARNING ASSISTED PARTICLE FILTERING

引用

IEEE International Conference on Acoustics, Speech and Signal processing

作者： Bin Liu School of Computer Science Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing 210023 China

ISBN: (纸本)9781538646595

关键词： incremental learning outlier particle filtering robust state filtering transfer learning outliers Transfer (Psychology) Particle filters learning (artificial intelligence) Filtration State estimation

来源：评论

学校读者我要写书评

暂无评论

UB-CQA: A user attribute based community question answering system

UB-CQA: A user attribute based community question answering ...

引用

International Conference on intelligent System and Knowledge Engineering, ISKE

作者： Ziye Zhu Xiaoqian Liu Huakang Li Tao Li School of Computer Science Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing Jiangsu China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China

intelligent Community Question Answering (CQA) system is a popular research topic in Natural Language processing (NLP) area. Recently, the development of distributed data mining has significantly improved the efficiency of the searching and sorting operations in CQA database. However, problems are left unanswered such as how to choose the best answer among multiple candidates for a single question. To solve this issue, we design a CQA system called UB-CQA. First, in database refinement part, we construct an optimized and structured database by the best answer choosing method leveraging user attribute provided by the response provider. Second, in human-computer part, the UB-CQA is able to search and provide a more satisfying answer to users by similarity calculation and re-ranking method leveraging text categorization information. Empirical evaluations show that the best answer choosing and the candidate question re-ranking methods bring great improvements in accuracy and reliability.

关键词： databases Knowledge based systems Mathematical model Knowledge discovery Internet Computer science

来源：评论

学校读者我要写书评

暂无评论

data-DRIVEN MODEL SET DESIGN FOR MODEL AVERAGED PARTICLE FILTER

arXiv

引用

arXiv 2019年

作者： Liu, Bin School of Computer Science Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China

This paper is concerned with sequential state filtering in the presence of nonlinearity, non-Gaussianity and model uncertainty. For this problem, the Bayesian model averaged particle filter (BMAPF) is perhaps one of the most efficient solutions. Major advances of BMAPF have been made, while it still lacks a generic and practical approach to design the model set. This paper fills in this gap by proposing a generic data-driven method for BMAPF model set design. Unlike existent methods, the proposed solution does not require any prior knowledge on the parameter value of the true model;it only assumes that a small number of noisy observations are pre-obtained. The Bayesian optimization (BO) method is adapted to search the model components, each of which is associated with a specific segment of the pre-obtained data set. The average performance of these model components is guaranteed since each one’s parameter value is elaborately tuned via BO to maximize the marginal likelihood. The diversity in the model components is also ensured, as different components match the different segments of the pre-obtained data set, respectively. Computer simulations are used to demonstrate the effectiveness of the proposed method. Copyright © 2019, The Authors. All rights reserved.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Non-structured Pruning for Deep-learning based Steganalytic Frameworks

Non-structured Pruning for Deep-learning based Steganalytic ...

引用

Asia-Pacific Signal and Information processing Association Annual Summit and Conference (APSIPA)

作者： Qiushi Li Zilong Shao Shunquan Tan Jishen Zeng Bin Li Shenzhen Key Laboratory of Media Security Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen China

ISBN: (数字)9781728132488

ISBN: (纸本)9781728132495

Image steganalysis aims to discriminate innocent cover images and those suspected stego images embedded with secret message. Recently, increasing advanced deep neural networks have been proposed and used in image steganalysis. Though those deep learning models can gain superior performance, they also result in redundancy of computational resource and memory storage. In this paper, we apply a non-structured pruning method to prune XuNet2 and SRNet - the two state-of-the-art deep-learning framework in the field of JPEG image steganalysis. We obtain the priorities of the connections among neurons according to a certain criterion, then keep those significant weights and prune those nonsignificant ones in the meantime. We have conducted extensive experiments on BOSSBase and BOWS image dataset. The experimental results demonstrate that our proposed non-structured pruning method can significantly reduce the cost of computation and storage required by the original deep-learning frameworks without affecting their detection accuracy.

关键词： Transform coding Training Convolution Computer architecture Computational modeling Brain modeling Testing

来源：评论

学校读者我要写书评

暂无评论

Named entity recognition for Chinese telecommunications field based on Char2Vec and Bi-LSTMs

Named entity recognition for Chinese telecommunications fiel...

引用

International Conference on intelligent System and Knowledge Engineering, ISKE

作者： Yu Wang Bin Xia Zheng Liu Yun Li Tao Li School of Computer Science Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing Jiangsu China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China

Named Entity Recognition (NER) is a basic task in Natural Language processing (NLP), which extracts the meaningful named entities from the text. Compared with the English NER, the Chinese NER is more challenge, since there is no tense in the Chinese language. Moreover, the omissions and the Internet catchwords in the Chinese corpus make the NER task more difficult. Traditional machine learning methods (e.g., CRFs) cannot address the Chinese NER effectively because they are hard to learn the complicated context in the Chinese language. To overcome the aforementioned problem, we propose a deep learning model Char2Vec+Bi-LSTMs for Chinese NER. We use the Chinese character instead of the Chinese word as the embedding unit, and the Bi-LSTMs is used to learn the complicated semantic dependency. To evaluate our proposed model, we construct the corpus from the China TELECOM FAQs. Experimental results show that our model achieves better performance than other baseline methods and the character embedding is more appropriate than the word embedding in the Chinese language.

关键词： Hidden Markov models Logic gates Computer architecture Machine learning Semantics Telecommunications

来源：评论

学校读者我要写书评

暂无评论

KCPMA: k-degree Contact Pattern Mining Algorithms for Moving Objects

KCPMA: k-degree Contact Pattern Mining Algorithms for Moving...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： You Chen Hua Dai Mingfeng Jiang Qu Lu Pengyue Li Bohan Li Geng Yang Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China Nanjing University of Aeronautics and Astronautics Nanjing China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

During infectious disease outbreaks, tracking contacted objects is important for suppressing the spread of the virus and using trajectories of moving objects to discover contacted objects is one of effective approaches. Existing algorithms focus on individual contact event discovery but lack the ability to obtain the k-degree contact events. In this paper, we propose efficient k-degree contact pattern mining algorithms that are capable of mining k-degree contact events. The definition of k-degree contact event is first formulated. Based on the definition, a sliding window-based baseline k-degree contact pattern mining algorithm (KCPMA) is presented. To improve the mining efficiency, the sample-point checking strategy and R-tree index are adopted and the optimized mining algorithm (KCPMA+) is proposed. Comprehensive experiments on real datasets demonstrate that the proposed algorithms are effective and efficient in mining k-degree contact events.

关键词： Costs Infectious diseases Federated learning Computer viruses Trajectory Indexes data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：