In order to achieve flow and increase player retention, it is important that games difficulty matches player skills. Being able to evaluate how people play a game is a crucial component for detecting gamers strategies in videogames. One of the main problems in player strategy detection is whether attributes selected to define strategies correctly detect the actions of the player. In this paper,...

In this paper, we propose an object segmentation framework, based on the popular bag of features (BoF), which can process several images per second while achieving a good segmentation accuracy assigning an object category to every pixel of the image. We propose an efficient color descriptor to complement the information obtained by a typical gradient-based local descriptor. Results show that co...

Clustering is a basic process in data analysis. It aims to partition a set of objects into groups called clusters such that, ideally, objects in the same group are similar and objects in different groups are dissimilar to each other. There are many scenarios where such a partition is useful. It may, for example, be used to structure the data to allow efficient information retrieval, to reduce t...

music analysis, information retrieval, multimedia indexing We motivate the problem of music recommendation based solely on acoustics from groups of related songs or 'song sets'. We propose four solutions which can be used with any acoustic-based similarity measure. The first builds a model for each song set and recommends new songs according to their distance from this model. The next three app...

Data mining is a method that is used to select the information from large datasets and it performs the principal task of data analysis. The Clustering is a technique that consist groups of data and elements into disjoined clusters of data. The same cluster data are related to similar cluster and different cluster data belong to different cluster. Clustering can be done different methods like pa...

A novel procedure for segmenting a set of scattered 3D data obtained from a head and shoulders multiview sequence is presented. The procedure consists of two steps. In the first step, two ellipses corresponding to the head and the body of the person are identified based on ellipse fitting of the outline of the person in each image. The fitting is based on a fast direct least squares method usin...

This paper implements a tool, referred to as the Automated Group Decomposition Program (AGDP), which divides a class of students into groups, using the k-means algorithm, for the purpose of collaborative learning, and then heterogenizes the groups based on a factor called the degree of heterogeneity (DOH). The tool takes as input two sets of scores and the students’ roll numbers and outputs the...

Given any positive integer r, our objective is to develop a strategy for grouping the states of a n-node network into r ≤ n distinct non-overlapping groups. The criterion for this partitioning is defined as follows. First, a LQR controller is defined for the original n-node network. Then, a r-dimensional reduced-order network is created by imposing a projection matrix P on the n-node open-loop ...

Australian Business Deans Council (ABDC); Bacon’s Media Directory; Burrelle’s Media Directory; Cabell’s Directories; Compendex (Elsevier Engineering Index); CSA Illumina; Current

This paper evaluates the use of the fuzzy k-means clustering method for the clustering of files of 2D chemical structures. Simulated property prediction experiments with the Starlist file of logP values demonstrate that use of the fuzzy k-means method can, in some cases, yield results that are superior to those obtained with the conventional k-means method and with Ward's clustering method. Clu...