Detecting the boundaries of protein domains is an important and challenging task in both experimental and computational structural biology. In this paper, a promising method for detecting the domain structure of a pro...
详细信息
Detecting the boundaries of protein domains is an important and challenging task in both experimental and computational structural biology. In this paper, a promising method for detecting the domain structure of a protein from sequence information alone is presented. The method is based on analyzing multiple sequence alignments derived from a database search. Multiple measures are defined to quantify the domain information content of each position along the sequence. Then they are combined into a single predictor using support vector machine. What is more important, the domain detection is first taken as an imbal- anced data learning problem. A novel undersampling method is proposed on distance-based maximal entropy in the feature space of Support Vector Machine (SVM). The overall precision is about 80%. Simulation results demonstrate that the method can help not only in predicting the complete 3D structure of a protein but also in the machine learning system on general im- balanced datasets.
In order to fully utilize lesion features and vascular structure and solve the problem of class imbalance, diabetes retinopathy (DR) grading is modeled as a dual-stage task, and the prior-guided dual-stage diabetes re...
详细信息
The integration of psychology and computer science has become the mainstream contemporary research method on psychological data. Weibo, China's largest open platform for communication and information sharing betwe...
详细信息
Plan recognition,the inverse problem of plan synthesis,is important wherever a system is expected to produce a kind of cooperative or competitive *** plan recognizers,however,suffer the problem of acquisition and hand...
详细信息
Plan recognition,the inverse problem of plan synthesis,is important wherever a system is expected to produce a kind of cooperative or competitive *** plan recognizers,however,suffer the problem of acquisition and hand-coding a larger plan *** paper is aims to show that modern planning techniques can help build plan recognition systems without suffering such ***,we show that the planning graph,which is an important component of the classical planning system Graphplan,can be used as an implicit,dynamic planning library to represent actions,plans and *** also show that modern plan generating technology can be used to find valid plans in this *** this sense,this method can be regarded as a bridge that connects these two research *** and theoretical results also show that the method is efficient and scalable.
This paper proposed a novel hybrid probabilistic network,which is a good tradeoff between the model complexity and learnability in *** relaxes the conditional independence assumptions of Naive Bayes while still permit...
详细信息
This paper proposed a novel hybrid probabilistic network,which is a good tradeoff between the model complexity and learnability in *** relaxes the conditional independence assumptions of Naive Bayes while still permitting efficient inference and *** studies on a set of natural domains prove its clear advantages with respect to the generalization ability.
Integrity constraint is a formula that checks whether all necessary information has been explicitly provided. It can be added into ontology to guarantee the data-centric application. In this paper,a set of constraint ...
详细信息
Integrity constraint is a formula that checks whether all necessary information has been explicitly provided. It can be added into ontology to guarantee the data-centric application. In this paper,a set of constraint axioms called IC-mapping axioms are stated. Based on these axioms,a special ontology with integrity constraint,which is adapted to map ontology knowledge to data in relational databases,is defined. It's generated through our checking and modification. Making use of the traditional mapping approaches,it can be mapped to relational databases as a normal ontology. Unlike what in the past,a novel mapping approach named IC-based mapping is proposed in accordance with such special ontology. The detailed algorithm is put forward and compared with other existing approaches used in Semantic Web applications. The result shows that our method is advanced to the traditional approaches.
Particle Swarm Optimization with Migration (MPSO) is proposed to solve the issue that PSO will encounter unbearable time cost problems when dealing with High-dimension, Expensive and Black-box objective function tasks...
详细信息
The optimization of job-shop scheduling is very important because of its theoretical and practical significance. This paper proposes an efficient scheduling method based on artificial immune systems. In the proposed m...
详细信息
In this paper, we describe a fast semi-automatic segmentation algorithm. A nodes aggregation method is proposed for improving the running time and a Graph-Cuts method is used to model the segmentation problem. The who...
详细信息
We systematically propose a dual-phase algorithm, DualRank, to mine the optimal profit in retailing market. DualRank algorithm has two major phases which are called mining general profit phase and optimizing profit ph...
详细信息
暂无评论