scholarly journals Online Strategy Clustering Based on Action Sequences in RoboCupSoccer Small Size League

Robotics ◽  
2019 ◽  
Vol 8 (3) ◽  
pp. 58
Author(s):  
Yusuke Adachi ◽  
Masahide Ito ◽  
Tadashi Naruse
Keyword(s):  
Experimental Results ◽  
Clustering Method ◽  
Learning Problem ◽  
Data Set ◽  
Geometric Data ◽  
Action Sequences ◽  
Novel Method ◽  
Online Strategy

This paper addresses a strategy learning problem in the RoboCupSoccer Small Size League (SSL). We propose a novel method based on action sequences to cluster an opponent’s strategies online. Our proposed method is composed of the following three steps: (1) extracting typical actions from geometric data to make action sequences, (2) calculating the dissimilarity of the sequences, and (3) clustering the sequences by using the dissimilarity. This method can reduce the amount of data used in the clustering process; handling action sequences instead of geometric data as data-set makes it easier to search actions. As a result, the proposed clustering method is online feasible and also is applicable to countering an opponent’s strategy. The effectiveness of the proposed method was validated by experimental results.

scholarly journals A Modified MinMaxk-Means Algorithm Based on PSO

2016 ◽  
Vol 2016 ◽  
pp. 1-13 ◽  
Author(s):  
Xiaoyan Wang ◽  
Yanping Bai
Keyword(s):  
Experimental Results ◽  
Data Sets ◽  
Clustering Method ◽  
Data Set ◽  
Original Algorithm ◽  
Executive Process ◽  
Proper Values ◽  
Two Parameters ◽  
Memory Parameter

The MinMaxk-means algorithm is widely used to tackle the effect of bad initialization by minimizing the maximum intraclustering errors. Two parameters, including the exponent parameter and memory parameter, are involved in the executive process. Since different parameters have different clustering errors, it is crucial to choose appropriate parameters. In the original algorithm, a practical framework is given. Such framework extends the MinMaxk-means to automatically adapt the exponent parameter to the data set. It has been believed that if the maximum exponent parameter has been set, then the programme can reach the lowest intraclustering errors. However, our experiments show that this is not always correct. In this paper, we modified the MinMaxk-means algorithm by PSO to determine the proper values of parameters which can subject the algorithm to attain the lowest clustering errors. The proposed clustering method is tested on some favorite data sets in several different initial situations and is compared to thek-means algorithm and the original MinMaxk-means algorithm. The experimental results indicate that our proposed algorithm can reach the lowest clustering errors automatically.

A Computational Method for the Identification of Endolysins and Autolysins

2020 ◽  
Vol 27 (4) ◽  
pp. 329-336 ◽  
Author(s):  
Lei Xu ◽  
Guangmin Liang ◽  
Baowen Chen ◽  
Xu Tan ◽  
Huaikun Xiang ◽  
...  
Keyword(s):  
Support Vector Machine ◽  
Cell Wall ◽  
Experimental Results ◽  
Computational Method ◽  
Lytic Enzyme ◽  
Support Vector ◽  
Lytic Enzymes ◽  
Data Set ◽  
Optimal Feature ◽  
Better Than

Background: Cell lytic enzyme is a kind of highly evolved protein, which can destroy the cell structure and kill the bacteria. Compared with antibiotics, cell lytic enzyme will not cause serious problem of drug resistance of pathogenic bacteria. Thus, the study of cell wall lytic enzymes aims at finding an efficient way for curing bacteria infectious. Compared with using antibiotics, the problem of drug resistance becomes more serious. Therefore, it is a good choice for curing bacterial infections by using cell lytic enzymes. Cell lytic enzyme includes endolysin and autolysin and the difference between them is the purpose of the break of cell wall. The identification of the type of cell lytic enzymes is meaningful for the study of cell wall enzymes. Objective: In this article, our motivation is to predict the type of cell lytic enzyme. Cell lytic enzyme is helpful for killing bacteria, so it is meaningful for study the type of cell lytic enzyme. However, it is time consuming to detect the type of cell lytic enzyme by experimental methods. Thus, an efficient computational method for the type of cell lytic enzyme prediction is proposed in our work. Method: We propose a computational method for the prediction of endolysin and autolysin. First, a data set containing 27 endolysins and 41 autolysins is built. Then the protein is represented by tripeptides composition. The features are selected with larger confidence degree. At last, the classifier is trained by the labeled vectors based on support vector machine. The learned classifier is used to predict the type of cell lytic enzyme. Results: Following the proposed method, the experimental results show that the overall accuracy can attain 97.06%, when 44 features are selected. Compared with Ding's method, our method improves the overall accuracy by nearly 4.5% ((97.06-92.9)/92.9%). The performance of our proposed method is stable, when the selected feature number is from 40 to 70. The overall accuracy of tripeptides optimal feature set is 94.12%, and the overall accuracy of Chou's amphiphilic PseAAC method is 76.2%. The experimental results also demonstrate that the overall accuracy is improved by nearly 18% when using the tripeptides optimal feature set. Conclusion: The paper proposed an efficient method for identifying endolysin and autolysin. In this paper, support vector machine is used to predict the type of cell lytic enzyme. The experimental results show that the overall accuracy of the proposed method is 94.12%, which is better than some existing methods. In conclusion, the selected 44 features can improve the overall accuracy for identification of the type of cell lytic enzyme. Support vector machine performs better than other classifiers when using the selected feature set on the benchmark data set.

Conical SNA using fuzzy k-medoids based on user experience

2021 ◽  
pp. 002072092098849
Author(s):  
Poonam Rani ◽  
MPS Bhatia ◽  
Devendra K Tayal
Keyword(s):  
Social Networks ◽  
Social Network ◽  
User Experience ◽  
Three Dimensional ◽  
Experimental Results ◽  
Dynamic Parameters ◽  
Clustering Method ◽  
Cone Model ◽  
Intelligent Approach ◽  
Conical Model

The paper presents an intelligent approach for the comparison of social networks through a cone model by using the fuzzy k-medoids clustering method. It makes use of a geometrical three-dimensional conical model, which astutely represents the user experience views. It uses both the static as well as the dynamic parameters of social networks. In this, we propose an algorithm that investigates which social network is more fruitful. For the experimental results, the proposed work is employed on the data collected from students from different universities through the Google forms, where students are required to rate their experience of using different social networks on different scales.

Validating Numerical CFD Simulations With Experimental Data for Turbulence Phenomena in Axial Flow Gas Turbine Diffusers

2009 ◽  
Author(s):  
Farrokh Zarifi-Rad ◽  
Hamid Vajihollahi ◽  
James O’Brien
Keyword(s):  
Experimental Data ◽  
Gas Turbine ◽  
Turbine Blades ◽  
Axial Flow ◽  
Experimental Results ◽  
Scale Model ◽  
Data Set ◽  
Pressure Profiles ◽  
Scale Models ◽  
Inlet Conditions

Scale models give engineers an excellent understanding of the aerodynamic behavior behind their design; nevertheless, scale models are time consuming and expensive. Therefore computer simulations such as Computational Fluid Dynamics (CFD) are an excellent alternative to scale models. One must ask the question, how close are the CFD results to the actual fluid behavior of the scale model? In order to answer this question the engineering team investigated the performance of a large industrial Gas Turbine (GT) exhaust diffuser scale model with performance predicted by commercially available CFD software. The experimental results were obtained from a 1:12 scale model of a GT exhaust diffuser with a fixed row of blades to simulate the swirl generated by the last row of turbine blades five blade configurations. This work is to validate the effect of the turbulent inlet conditions on an axial diffuser, both on the experimental front and on the numerical analysis approach. The object of this work is to bring forward a better understanding of velocity and static pressure profiles along the gas turbine diffusers and to provide an accurate experimental data set to validate the CFD prediction. For the CFD aspect, ANSYS CFX software was chosen as the solver. Two different types of mesh (hexagonal and tetrahedral) will be compared to the experimental results. It is understood that hexagonal (HEX) meshes are more time consuming and more computationally demanding, they are less prone to mesh sensitivity and have the tendancy to converge at a faster rate than the tetrahedral (TET) mesh. It was found that the HEX mesh was able to generate more consistent results and had less error than TET mesh.

A Novel Locality Sensitive K-Means Clustering Algorithm based on Core Clusters

2013 ◽  
Vol 321-324 ◽  
pp. 1939-1942
Author(s):  
Lei Gu
Keyword(s):  
Clustering Algorithm ◽  
Experimental Results ◽  
Clustering Method ◽  
Neighborhood Graph ◽  
The Core ◽  
Random Samples

The locality sensitive k-means clustering method has been presented recently. Although this approach can improve the clustering accuracies, it often gains the unstable clustering results because some random samples are employed for the initial centers. In this paper, an initialization method based on the core clusters is used for the locality sensitive k-means clustering. The core clusters can be formed by constructing the σ-neighborhood graph and their centers are regarded as the initial centers of the locality sensitive k-means clustering. To investigate the effectiveness of our approach, several experiments are done on three datasets. Experimental results show that our proposed method can improve the clustering performance compared to the previous locality sensitive k-means clustering.

scholarly journals A simple clustering technique to extract subsets of data for function approximation

2015 ◽  
Vol 17 (5) ◽  
pp. 719-732
Author(s):  
Dulakshi Santhusitha Kumari Karunasingha ◽  
Shie-Yui Liong
Keyword(s):  
Function Approximation ◽  
Prediction Models ◽  
Data Extraction ◽  
Single Parameter ◽  
Subtractive Clustering ◽  
Data Sets ◽  
Clustering Methods ◽  
Clustering Method ◽  
Data Set ◽  
Functional Relationships

A simple clustering method is proposed for extracting representative subsets from lengthy data sets. The main purpose of the extracted subset of data is to use it to build prediction models (of the form of approximating functional relationships) instead of using the entire large data set. Such smaller subsets of data are often required in exploratory analysis stages of studies that involve resource consuming investigations. A few recent studies have used a subtractive clustering method (SCM) for such data extraction, in the absence of clustering methods for function approximation. SCM, however, requires several parameters to be specified. This study proposes a clustering method, which requires only a single parameter to be specified, yet it is shown to be as effective as the SCM. A method to find suitable values for the parameter is also proposed. Due to having only a single parameter, using the proposed clustering method is shown to be orders of magnitudes more efficient than using SCM. The effectiveness of the proposed method is demonstrated on phase space prediction of three univariate time series and prediction of two multivariate data sets. Some drawbacks of SCM when applied for data extraction are identified, and the proposed method is shown to be a solution for them.

scholarly journals Research of Personalized Recommendation Technology Based on Knowledge Graphs

2021 ◽  
Vol 11 (15) ◽  
pp. 7104
Author(s):  
Xu Yang ◽  
Ziyi Huan ◽  
Yisong Zhai ◽  
Ting Lin
Keyword(s):  
Neural Network ◽  
Hot Spot ◽  
Experimental Results ◽  
Graph Representation ◽  
Personalized Recommendation ◽  
Knowledge Graph ◽  
Learning Technology ◽  
Data Set ◽  
Model Based ◽  
Knowledge Graphs

Nowadays, personalized recommendation based on knowledge graphs has become a hot spot for researchers due to its good recommendation effect. In this paper, we researched personalized recommendation based on knowledge graphs. First of all, we study the knowledge graphs’ construction method and complete the construction of the movie knowledge graphs. Furthermore, we use Neo4j graph database to store the movie data and vividly display it. Then, the classical translation model TransE algorithm in knowledge graph representation learning technology is studied in this paper, and we improved the algorithm through a cross-training method by using the information of the neighboring feature structures of the entities in the knowledge graph. Furthermore, the negative sampling process of TransE algorithm is improved. The experimental results show that the improved TransE model can more accurately vectorize entities and relations. Finally, this paper constructs a recommendation model by combining knowledge graphs with ranking learning and neural network. We propose the Bayesian personalized recommendation model based on knowledge graphs (KG-BPR) and the neural network recommendation model based on knowledge graphs(KG-NN). The semantic information of entities and relations in knowledge graphs is embedded into vector space by using improved TransE method, and we compare the results. The item entity vectors containing external knowledge information are integrated into the BPR model and neural network, respectively, which make up for the lack of knowledge information of the item itself. Finally, the experimental analysis is carried out on MovieLens-1M data set. The experimental results show that the two recommendation models proposed in this paper can effectively improve the accuracy, recall, F1 value and MAP value of recommendation.

scholarly journals Imbalanced Learning Based on Logistic Discrimination

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Huaping Guo ◽  
Weimei Zhi ◽  
Hongbing Liu ◽  
Mingliang Xu
Keyword(s):  
Statistical Model ◽  
Cost Function ◽  
State Of The Art ◽  
Class Imbalance ◽  
Imbalanced Learning ◽  
Learning Problem ◽  
Logistic Discrimination ◽  
Positive Class ◽  
Negative Class ◽  
Novel Method

In recent years, imbalanced learning problem has attracted more and more attentions from both academia and industry, and the problem is concerned with the performance of learning algorithms in the presence of data with severe class distribution skews. In this paper, we apply the well-known statistical model logistic discrimination to this problem and propose a novel method to improve its performance. To fully consider the class imbalance, we design a new cost function which takes into account the accuracies of both positive class and negative class as well as the precision of positive class. Unlike traditional logistic discrimination, the proposed method learns its parameters by maximizing the proposed cost function. Experimental results show that, compared with other state-of-the-art methods, the proposed one shows significantly better performance on measures of recall,g-mean,f-measure, AUC, and accuracy.

scholarly journals Embedding Undersampling Rotation Forest for Imbalanced Problem

2018 ◽  
Vol 2018 ◽  
pp. 1-15 ◽  
Author(s):  
Huaping Guo ◽  
Xiaoyu Diao ◽  
Hongbing Liu
Keyword(s):  
Imbalanced Data ◽  
Feature Space ◽  
Original Data ◽  
Training Set ◽  
Data Set ◽  
Minority Class ◽  
Rotation Forest ◽  
Novel Method ◽  
Individual Classifier ◽  
The Cost

Rotation Forest is an ensemble learning approach achieving better performance comparing to Bagging and Boosting through building accurate and diverse classifiers using rotated feature space. However, like other conventional classifiers, Rotation Forest does not work well on the imbalanced data which are characterized as having much less examples of one class (minority class) than the other (majority class), and the cost of misclassifying minority class examples is often much more expensive than the contrary cases. This paper proposes a novel method called Embedding Undersampling Rotation Forest (EURF) to handle this problem (1) sampling subsets from the majority class and learning a projection matrix from each subset and (2) obtaining training sets by projecting re-undersampling subsets of the original data set to new spaces defined by the matrices and constructing an individual classifier from each training set. For the first method, undersampling is to force the rotation matrix to better capture the features of the minority class without harming the diversity between individual classifiers. With respect to the second method, the undersampling technique aims to improve the performance of individual classifiers on the minority class. The experimental results show that EURF achieves significantly better performance comparing to other state-of-the-art methods.

scholarly journals Measuring the Effect of Revealed Cultural Preferences on Tourism Exports

2018 ◽  
Vol 58 (8) ◽  
pp. 1262-1273 ◽  
Author(s):  
Sylvain Petit ◽  
Neelu Seetaram
Keyword(s):  
Gravity Model ◽  
Bilateral Trade ◽  
Data Set ◽  
Dummy Variables ◽  
Cultural Preferences ◽  
Step Procedure ◽  
Cultural Variable ◽  
Cultural Preference ◽  
Novel Method ◽  
Time Invariant

The aim of this article is to propose a novel method for measuring the effect of cultural preference on bilateral tourism receipts. The method applied is inspired from Disdier et al. (2010). Using the UNESCO classification and data on bilateral trade in cultural product, a proxy for cultural preferences is constructed. The variable is used in a gravity model for tourism export, which is estimated using a two-step procedure to avoid issues related to endogeneity. The data set used is a panel of 12 OECD countries for a period of 11 years. The variable for cultural preferences eliminates the problems with traditional methods, which by using dummy variables to account for cultural preferences, assume that the latter are time-invariant and symmetrical. The cultural variable constructed is found to be significant in explaining bilateral tourism exports with an elasticity of 0.39.

Sign in / Sign up

Export Citation Format

Share Document