Feature Representation of Motion Trajectories

Author(s):  
X.T. Nguyen ◽  
A. Bouzerdoum ◽  
R.E. Bogner ◽  
A. Moini ◽  
K. Eshraghian
2014 ◽  
Vol 35 (1) ◽  
pp. 121-135 ◽  
Author(s):  
Tomasz Rydzkowski ◽  
Iwona Michalska-Pożoga

Abstract The paper presents the summary of research on polymer melt particle motion trajectories in a disc zone of a screw-disk extruder. We analysed two models of its structure, different in levels of taken simplifications. The analysis includes computer simulations of material particle flow and results of experimental tests to determine the properties of the resultant extrudate. Analysis of the results shows that the motion of melt in the disk zone of a screw-disk extruder is a superposition of pressure and dragged streams. The observed trajectories of polymer particles and relations of mechanical properties and elongation of the molecular chain proved the presence of a stretching effect on polymer molecular chains.


Author(s):  
Alice Rueda ◽  
J.C. Vásquez-Correa ◽  
Cristian David Rios-Urrego ◽  
Juan Rafael Orozco-Arroyave ◽  
Sridhar Krishnan ◽  
...  

2019 ◽  
Vol 20 (5) ◽  
pp. 565-578 ◽  
Author(s):  
Lidong Wang ◽  
Ruijun Zhang

Ubiquitination is an important post-translational modification (PTM) process for the regulation of protein functions, which is associated with cancer, cardiovascular and other diseases. Recent initiatives have focused on the detection of potential ubiquitination sites with the aid of physicochemical test approaches in conjunction with the application of computational methods. The identification of ubiquitination sites using laboratory tests is especially susceptible to the temporality and reversibility of the ubiquitination processes, and is also costly and time-consuming. It has been demonstrated that computational methods are effective in extracting potential rules or inferences from biological sequence collections. Up to the present, the computational strategy has been one of the critical research approaches that have been applied for the identification of ubiquitination sites, and currently, there are numerous state-of-the-art computational methods that have been developed from machine learning and statistical analysis to undertake such work. In the present study, the construction of benchmark datasets is summarized, together with feature representation methods, feature selection approaches and the classifiers involved in several previous publications. In an attempt to explore pertinent development trends for the identification of ubiquitination sites, an independent test dataset was constructed and the predicting results obtained from five prediction tools are reported here, together with some related discussions.


2020 ◽  
Vol 17 (4) ◽  
pp. 271-286
Author(s):  
Chang Xu ◽  
Limin Jiang ◽  
Zehua Zhang ◽  
Xuyao Yu ◽  
Renhai Chen ◽  
...  

Background: Protein-Protein Interactions (PPIs) play a key role in various biological processes. Many methods have been developed to predict protein-protein interactions and protein interaction networks. However, many existing applications are limited, because of relying on a large number of homology proteins and interaction marks. Methods: In this paper, we propose a novel integrated learning approach (RF-Ada-DF) with the sequence-based feature representation, for identifying protein-protein interactions. Our method firstly constructs a sequence-based feature vector to represent each pair of proteins, viaMultivariate Mutual Information (MMI) and Normalized Moreau-Broto Autocorrelation (NMBAC). Then, we feed the 638- dimentional features into an integrated learning model for judging interaction pairs and non-interaction pairs. Furthermore, this integrated model embeds Random Forest in AdaBoost framework and turns weak classifiers into a single strong classifier. Meanwhile, we also employ double fault detection in order to suppress over-adaptation during the training process. Results: To evaluate the performance of our method, we conduct several comprehensive tests for PPIs prediction. On the H. pyloridataset, our method achieves 88.16% accuracy and 87.68% sensitivity, the accuracy of our method is increased by 0.57%. On the S. cerevisiaedataset, our method achieves 95.77% accuracy and 93.36% sensitivity, the accuracy of our method is increased by 0.76%. On the Humandataset, our method achieves 98.16% accuracy and 96.80% sensitivity, the accuracy of our method is increased by 0.6%. Experiments show that our method achieves better results than other outstanding methods for sequence-based PPIs prediction. The datasets and codes are available at https://github.com/guofei-tju/RF-Ada-DF.git.


2019 ◽  
Vol 14 (6) ◽  
pp. 480-490 ◽  
Author(s):  
Tuncay Bayrak ◽  
Hasan Oğul

Background: Predicting the value of gene expression in a given condition is a challenging topic in computational systems biology. Only a limited number of studies in this area have provided solutions to predict the expression in a particular pattern, whether or not it can be done effectively. However, the value of expression for the measurement is usually needed for further meta-data analysis. Methods: Because the problem is considered as a regression task where a feature representation of the gene under consideration is fed into a trained model to predict a continuous variable that refers to its exact expression level, we introduced a novel feature representation scheme to support work on such a task based on two-way collaborative filtering. At this point, our main argument is that the expressions of other genes in the current condition are as important as the expression of the current gene in other conditions. For regression analysis, linear regression and a recently popularized method, called Relevance Vector Machine (RVM), are used. Pearson and Spearman correlation coefficients and Root Mean Squared Error are used for evaluation. The effects of regression model type, RVM kernel functions, and parameters have been analysed in our study in a gene expression profiling data comprising a set of prostate cancer samples. Results: According to the findings of this study, in addition to promising results from the experimental studies, integrating data from another disease type, such as colon cancer in our case, can significantly improve the prediction performance of the regression model. Conclusion: The results also showed that the performed new feature representation approach and RVM regression model are promising for many machine learning problems in microarray and high throughput sequencing analysis.


2019 ◽  
Vol 14 (5) ◽  
pp. 406-421 ◽  
Author(s):  
Ting-He Zhang ◽  
Shao-Wu Zhang

Background: Revealing the subcellular location of a newly discovered protein can bring insight into their function and guide research at the cellular level. The experimental methods currently used to identify the protein subcellular locations are both time-consuming and expensive. Thus, it is highly desired to develop computational methods for efficiently and effectively identifying the protein subcellular locations. Especially, the rapidly increasing number of protein sequences entering the genome databases has called for the development of automated analysis methods. Methods: In this review, we will describe the recent advances in predicting the protein subcellular locations with machine learning from the following aspects: i) Protein subcellular location benchmark dataset construction, ii) Protein feature representation and feature descriptors, iii) Common machine learning algorithms, iv) Cross-validation test methods and assessment metrics, v) Web servers. Result & Conclusion: Concomitant with a large number of protein sequences generated by highthroughput technologies, four future directions for predicting protein subcellular locations with machine learning should be paid attention. One direction is the selection of novel and effective features (e.g., statistics, physical-chemical, evolutional) from the sequences and structures of proteins. Another is the feature fusion strategy. The third is the design of a powerful predictor and the fourth one is the protein multiple location sites prediction.


2020 ◽  
Vol 16 (6) ◽  
pp. 3721-3730 ◽  
Author(s):  
Xiaofeng Yuan ◽  
Jiao Zhou ◽  
Biao Huang ◽  
Yalin Wang ◽  
Chunhua Yang ◽  
...  

2020 ◽  
Vol 5 (2) ◽  
pp. 676-682
Author(s):  
Andrey Rudenko ◽  
Tomasz P. Kucner ◽  
Chittaranjan S. Swaminathan ◽  
Ravi T. Chadalavada ◽  
Kai O. Arras ◽  
...  

AI ◽  
2021 ◽  
Vol 2 (2) ◽  
pp. 195-208
Author(s):  
Gabriel Dahia ◽  
Maurício Pamplona Segundo

We propose a method that can perform one-class classification given only a small number of examples from the target class and none from the others. We formulate the learning of meaningful features for one-class classification as a meta-learning problem in which the meta-training stage repeatedly simulates one-class classification, using the classification loss of the chosen algorithm to learn a feature representation. To learn these representations, we require only multiclass data from similar tasks. We show how the Support Vector Data Description method can be used with our method, and also propose a simpler variant based on Prototypical Networks that obtains comparable performance, indicating that learning feature representations directly from data may be more important than which one-class algorithm we choose. We validate our approach by adapting few-shot classification datasets to the few-shot one-class classification scenario, obtaining similar results to the state-of-the-art of traditional one-class classification, and that improves upon that of one-class classification baselines employed in the few-shot setting.


Sign in / Sign up

Export Citation Format

Share Document