35820562
Named Entity Recognition in Biomedical Literature: A Comparison of Support Vector Machines and Conditional Random Fields
In this paper, we propose two named entity recognition systems for biomedical literature, System1 using support vector machines and System2 using conditional random fields. Through employing several sets of experiments, we make a comprehensive comparison between these two systems. The final results reflect that System2 can achieve higher accuracy than System1, because System2 can catch more essential properties by handling the richer set of features, i.e., adding not only the individual and dynamic features as System1 does but also the combinational features, which can improve the performance further. Furthermore, with carefully designed features, System2 can recognize named entities in biomedical literature with fairly high accuracy, which can achieve the precision of 89.43%, recall of 83.32% and balanced F β= 1 score of 86.28%.
36831968
Evaluating and Comparing Biomedical Term Identification Systems
In this paper, we propose a term identification system using conditional random fields (CRFs) on two biomedical datasets. Through employing several sets of experiments, we make a comprehensive investigation for different types of features. The final experimental results reflect that with carefully designed features i.e., adding not only the individual and dynamic features but also the combinational features, our system can identify biomedical terms with fairly high accuracy on both datasets, compared with other top systems already published in the literature.
1280778
Splice Site Prediction using Support Vector Machines with Context-Sensitive Kernel Functions
This paper focuses on the use of support vector machines on a typical context-dependent classification task, splice site prediction. For this type of problems, it has been shown that a context-based approach should be preferred over a transfor- mation approach because the former approach can easily incorporate statistical mea- sures or directly plug sensitivity information into distance functions. In this paper, we designed three types of context-sensitive kernel functions: polynomial-based, radial basis function-based and negative distance-based kernels. From the experimental re- sults it becomes clear that the radial basis function-based kernel with information gain weighting gets the best accuracies and can always outperform their simple non-sensitive counterparts both in accuracy and in model complexity. And with well designed fea- tures and carefully chosen context sizes, our system can predict splice sites with fairly high accuracy, which can achieve the FP95% rate, 3.94 for donor sites and 5.98 for acceptor sites, an approximate state of the art performance for the moment.
13345001
Context-Sensitive Kernel Functions: A Distance Function Viewpoint
This paper extends the idea of weighted distance functions to kernels and support vector machines. Here, we focus on applications that rely on sliding a window over a sequence of string data. For this type of problems it is argued that a symbolic, context-based representation of the data should be preferred over a continuous, real format as this is a much more intuitive setting for working with (weighted) distance functions. It is shown how a weighted string distance can be decomposed and subsequently used in different kernel functions and how these kernel functions correspond to real kernels between the continuous, real representations of the symbolic, context-based representations of the vectors.
122468009
Truth and absolute truth in neutrosophic logic
As a philosophical analysis of some fatal paradoxes, the paper distinguishes the conceptual difference between representation of truth and source of truth, and leads to the conclusion that in order to acquire the genuine source of truth, independently of specific representations possibly belonging to different worlds, one is necessary to ignore all the ideas, logics, conceptions, philosophies and representable knowledge even himself belonging to those misleading worlds, returning to his infant nature, as a preliminary step for his cultivation of unconstrained wisdom. It also carries out some coordinative crucial issues as natural-doctrine, minded-unwitting, logic-infancy, conception-deconception, determinacy-indeterminacy. The paper tries to verify the role of neutrosophy and neutrosophic logic in religious issues and open a gateway toward the oriental classics, excavating the lost treasure.
16252151
A Topology Optimization for Truss Based on Improved Group Search Optimizer
In this paper, a novel optimization algorithm, named group search optimizer (GSO) with two improvements, is used to truss structure topology optimization. And the improved methods are using harmony memory and adhering to the boundary which can improve the algorithm obviously. Then a simple and effective topology method, discretization of topology variables is incorporated with improved GSO to make sure that the topology optimization works well. In the end of the paper, two topology optimal models, a planar truss and a spatial truss, are used to test this topology methods based on the improved GSO. The results show that the method with improved GSO is feasible and robust for truss topology optimization.
4963124
Blind equalization Using ν- support vector regressor for constant modulus signals
The support vector machine has been recently developed for blind equalization of constant modulus signals. In this paper we propose to use a v-support vector regressor (nu-SVR) for blindly equalizing multipath channels because of the high generalization ability of the SVR for short burst sequences. A weighted least square procedure is presented for solving the blind nu-SVR equalizer. The performance of the proposed algorithm is analyzed by means of computer simulations.
35354920
Color text image binarization based on binary texture analysis
In this paper, a novel binarization algorithm for color text images is presented. This algorithm effectively integrates color clustering and binary texture analysis, and is capable of handling situations with complex backgrounds. In this algorithm, dimensionality reduction and graph theoretical clustering are first employed. As the result, binary images related to clusters can be obtained. Binary texture analysis is then performed on each candidate binary image. Two kinds of effective texture features, run-length histogram and spatial-size distribution related respectively, are extracted and explored. Cooperating with an LDA classifier, the optimal candidate of the best binarization effect is obtained. Experiments with images collected from Internet has been carried out and compared with existing techniques, both show the effectiveness of the algorithm.
33185687
Supremum of Agent Number Needed in Analyzing Security Protocols Based on Horn Logic