The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Autonomous steering control is the principal task in the development of an intelligent transportation system. This research paper proposes a novel approach for vision based intelligent control of unmanned vehicles. The paper addresses the problems of accurate and efficient intelligent vehicle control by incorporating a well known evolutionary algorithm cAnt-Miner. The uniqueness of the proposed algorithm...
To date, various fields of applications have utilized spatio-temporal databases not only to store data, but to support decision making. For example, in traffic accident analysis; it is required to have knowledge on the pattern of accidents resulting in death. Thus, in such analysis, clustering technique is desired to implement pattern extraction. This paper presents clustering of spatio-temporal database...
The optimal product line design problem consists of predicting the acceptance of new products in the market, prior of the actual production phase. It requires a unique blend of techniques and resources as it deals with multiple parameters and hard optimization problems. This paper proposes a service oriented architecture which outlines the basic features that a marketing decision support system should...
Fuzzy C-means (FCM) and Rough K-means (RKM) algorithms are two popular soft clustering algorithms that allow for overlapping clusters. The overlapping clusters can be useful in applications where restrictions imposed by crisp clustering that force assignment of every object to a unique cluster may not be practical. Likewise RKM and FCM, interval set representation of clusters would also generate overlapping...
Co-occurrence data matrices arise frequently in various important applications such as a document clustering. By considering a multinomial mixture model, we present a new probabilistic Self-Organizing Map (SOM) for clustering and visualizing this kind of data. Contrary to SOM, our proposed learning algorithm optimizes an objective function. Its performances are evaluated by using Monte Carlo simulations...
To recognize unlimited set of handwritten Arabic words, an efficient segmentation algorithm is needed to segment these cursive words into a limited set of primal graphemes. We propose a rule-based segmentation algorithm that segments cursive words into graphemes through collecting special feature points from the word skeleton. The development of this algorithm is motivated by the need to solve problems...
In data grids, the fast and proper replica selection decision leads to better resource utilization due to reduction in latencies to access the best replicas and speed up the execution of the data grid jobs. In this paper, we propose a new strategy that improves replica selection in data grids with the help of the reduct concept of the Rough Set Theory (RST). Using Quickreduct algorithm the unsupervised...
Image analysis is one of the common application fields in medical especially in cytology. Visual interpretation is the core for most medical diagnostic procedure. This process is tedious especially in the existence of overlapping cells therefore it is crucial to split the overlapping cells into single ones. This study proposes an overlapping cells separation method for separating the overlapping cells...
The biclustering problem consists in simultaneously clustering rows and columns of a data matrix. The aim of this paper is to empirically assess the performance of cooperative coevolution as an alternative approach for coping with the task of discovering good and sizeable biclusters. For this purpose, two cooperative coevolutionary algorithms, one configured with genetic algorithms (GAs) and another...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.