With the rapid development of Internet technology, crowdsourcing, as a flexible, effective and low-cost problem-solving method, has begun to receive more and more attention. The use of crowdsourcing to evaluate the qu...
With the rapid development of Internet technology, crowdsourcing, as a flexible, effective and low-cost problem-solving method, has begun to receive more and more attention. The use of crowdsourcing to evaluate the quality of linked data has also become a research hotspot. This paper proposes the concept of Domain Specialization Test (DST), which uses domain professional testing tasks DSTs to evaluate the professionalism of workers, and combines the idea of Mini-batch Gradient Descent (MBGD) to improve the EM algorithm, and the MBEM algorithm is proposed to achieve efficient and accurate evaluation of task results. The experimental results show that the proposed method can screen out the appropriate workers for the linked data crowdsourcing task and improve the accuracy and iteration efficiency of the results.
With the extensive application of the knowledge base (KB), how to complete it is a hot topic on Semantic Web. However, many problems go with the bigdata, and the event matching is one of these problems, which is find...
With the extensive application of the knowledge base (KB), how to complete it is a hot topic on Semantic Web. However, many problems go with the bigdata, and the event matching is one of these problems, which is finding out the entities referring to the same things in the real world and also the key point in the extending process. To enrich the emergency knowledge base (E-SKB) we constructed before, we need to filter out the news from several web pages and find the same news to avoid data redundancy. In this paper, we proposed a hierarchy blocking method to reduce the times of comparisons and narrow down the scope by extracting the news properties as the blocking keys. The method transforms the event matching problem into a clustering problem. Experimental results show that the proposed method is superior to the existing text clustering algorithm with high precision and less comparison times.
This paper studies the problem of relationship prediction in heterogeneous information networks. Our goal is not only to predict links/relationships more accurately but also to provide more viable paths to facilitate ...
详细信息
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 typ...
详细信息
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.
作者:
Xu HeBin LiuKejia ChenSchool of Computer Science
Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing Jiangsu 210023 China
The growth of Internet commerce has stimulated the use of collaborative filtering (CF) algorithms as recommender systems. A CF algorithm recommends items of interest to the target user by leveraging the votes given by...
The growth of Internet commerce has stimulated the use of collaborative filtering (CF) algorithms as recommender systems. A CF algorithm recommends items of interest to the target user by leveraging the votes given by other similar users. In a standard CF framework, it is assumed that the credibility of every voting user is exactly the same with respect to the target user. This assumption is not satisfied and thus may lead to misleading recommendations in many practical applications. A natural countermeasure is to design a trust-aware CF (TaCF) algorithm, which can take account of the difference in the credibilities of the voting users when performing CF. To this end, this paper presents a trust inference approach, which can predict the implicit trust of the target user on every voting user from a sparse explicit trust matrix. Then an improved CF algorithm termed iTrace is proposed, which takes advantage of both the explicit and the predicted implicit trust to provide recommendations with the CF framework. An empirical evaluation on a public dataset demonstrates that the proposed algorithm provides a significant improvement in recommendation quality in terms of mean absolute error.
Bernard combines the weight updating of the boosting algorithm with the Random Forest(RF),and proposes a new RF induction algorithm called Dynamic Random Forest(DRF).The idea with DRF is to grow only trees that would ...
详细信息
Bernard combines the weight updating of the boosting algorithm with the Random Forest(RF),and proposes a new RF induction algorithm called Dynamic Random Forest(DRF).The idea with DRF is to grow only trees that would fit the sub-forest already built,use the existing forest to update the weight of each randomly selected training instance,force the next tree to pay attention to those samples that can not be classified well by the current forest,thus improving the RF ***,this weight updating method is still flawed,which does not make a good distinction between the samples classified correctly and the samples classified wrongly by the current *** this paper,we implement the DRF algorithm,and propose a new weight update method,that is,giving higher weight to the samples classified wrongly by the current forest,giving lower weight to the samples classified correctly by the current forest,so that the next tree will be more concerned with those misclassified *** results show that our method is better than DRF algorithm and traditional RF algorithm.
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, ex...
详细信息
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.
UAV is an unmanned aerial vehicle controlled by a remote radio signal or a trajectory planning software carried itself. It is widely used in military, civil and scientific research fields. However, due to the lack of ...
UAV is an unmanned aerial vehicle controlled by a remote radio signal or a trajectory planning software carried itself. It is widely used in military, civil and scientific research fields. However, due to the lack of real-time decision-making ability, the UAV has high fault rate. The flight quality assessment of UAV and the construction of fault prediction model can be used for debugging and fault-removing to customer’s aircraft, and also to increase the added value of the civilian UAV products. Before building a fault prediction model, a very important step is to identify the pattern of sampled data. For each group of flight data, the efficiency and accuracy rate of manual quality evaluation and fault identification are not acceptable. Based on the UAV flight data accumulated in the bigdata platform of an UAV production company in Shenyang, Liaoning Province of China, this paper proposes a semi-supervised clustering technique to do automatic pattern recognition for the sampling points. According to the characteristics of UAV flight data, two different methods are designed to choose initial centroids. Meanwhile, we use the existing normal flight data to train distance thresholds to combine some clusters to eliminate the resulting error clustering. Real flight data or flight test data with manually added labels are used to run the proposed algorithms to verify the recognition results. The experimental results show that the proposed methods greatly improve the efficiency and accuracy of adding precise labels to the historical flight data and play a role in assisting the manual recognition of sampling points while strengthening the management and statistics.
This paper investigates the distributed motion planning of multiple robot arms with limited communications in the presence of noises. To do this, a nonlinearly-activated noise-tolerant zeroing neural network (NANTZNN)...
详细信息
ISBN:
(纸本)9781509061839
This paper investigates the distributed motion planning of multiple robot arms with limited communications in the presence of noises. To do this, a nonlinearly-activated noise-tolerant zeroing neural network (NANTZNN) is designed and presented for the first time for solving the presented distributed scheme online. Theoretical analyses and simulation results show the effectiveness and accuracy of the presented distributed scheme with the aid of NANTZNN model.
Recently,many researchers have concentrated on using neu-ral networks to learn features for Distant Supervised Relation Extraction(DSRE).However,these approaches generally employ a softmax classi-fier with cross-entro...
详细信息
ISBN:
(纸本)9783319690049
Recently,many researchers have concentrated on using neu-ral networks to learn features for Distant Supervised Relation Extraction(DSRE).However,these approaches generally employ a softmax classi-fier with cross-entropy loss,and bring the noise of artificial class NA into classification ***,the class imbalance problem is serious in the automatically labeled data,and results in poor classification rates on minor classes in traditional *** this work,we exploit cost-sensitive ranking loss to improve *** first uses a Piecewise Convolutional Neural Network(PCNN)to embed the semantics of *** the features are fed into a classifier which takes into account both the ranking loss and ***-periments show that our method is effective and performs better than state-of-the-art methods.
暂无评论