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.
Defining a boundary between inliers and outliers is a major challenge in unsupervised outlier detection. In the absence of labeled data, the true outliers set cannot be evaluated. This lays the burden on both the choice of an efficient outlier detection criterion, and parameter selection. While numerous unsupervised outlier detection criteria, with different parameters, have been proposed, an unsupervised...
The selection of a particular neural network model belonging to the Pareto front is a problem that exists in all multi-objective algorithms. This paper proposes a novel solution to this problem based on a linear combination of the outputs of the two extremes in the Pareto front, which form an ensemble. The decision support TOPSIS method is used to determine which linear combination creates the best...
The main purpose of this paper is to present a new approach for High-Stake Decision Support Systems. We introduce the challenge of the exploitation of heterogeneous community-based knowledge for decision-aid in critical situations. Knowledge shared in e-communities can be very rich, but is also inherently chaotic and questionable. Such uncontrolled knowledge is not usually considered in High-Stake...
In this paper, we propose an associative watermarking scheme which is conducted by the concept of Association Mining Rules (AMRs) and the ideas of Vector Quantization (VQ) and Soble operator. Performing associative watermarking rules to the images will reduct the amount of the embedded data, and using VQ indexing scheme can easily recall the embedded watermark for the purpose of image authentication,...
Linear Linkage Encoding (LLE) is a powerful encoding scheme utilized when genetic algorithms (GAs) are applied to grouping problems. It discards the redundancy of other traditional encoding schemes. However, some genetic operators are quite costly in terms of computational time when LLE is utilized. In this study, two supplementary encoding schemes Linear Linkage Encoding with Ending Node Links (LLE-e)...
A set of distributed continual range query requests, each defining a geographical region of interest, needs to be periodically reevaluated to provide up to date answers. Processing these continual queries efficiently and incrementally becomes important for location based services and applications. In this paper, we propose an efficient incremental method for continuous range query characterized by...
The advantages of soft c-means over its hard and fuzzy versions render it more attractive to use in a wide variety of applications. Its main merit lies in its relatively higher convergence speed, which is more obvious in the presence of huge high dimensional data. This work presents a new approach to accelerate the convergence of the original soft c-means. It is mainly based on an iterative optimization...
This paper introduces a relational fuzzy c-means clustering algorithm that is able to partition objects taking into account simultaneously several dissimilarity matrices. The aim is to obtain a collaborative role of the different dissimilarity matrices in order to obtain a final consensus partition. These matrices could have been obtained using different sets of variables and dissimilarity functions...
Feature selection is a very important preprocessing step in data classification. By applying it we are able to reduce the dimensionality of the problem by removing redundant or irrelevant data. High dimensional data sets are becoming usual nowadays specially in bio-informatics, biology, signal processing or text classification, increasing the need for efficient feature selection methods. In this paper...
Techniques exist to synthesize software architecture using genetic algorithms that employ transformations based on mutations and crossover. In this paper, we demonstrate that complementary crossover can significantly improve this technique. We study two versions of complementary crossover, one in which parents are selected so that they complement each other but the genes are inherited randomly from...
This paper regards a group decision-making process, where experts' estimates are expressed by triangular fuzzy numbers (TFNs). It presents an approach for determination of the degree of coordination, the closeness of these opinions. The implementation of the idea is based on the metric approach providing an easy procedure to determine the coordination degree of experts' opinions. A concept of the...
The paper deals with using so called singularity exponent in a classifier that is based on ordered distances of patterns to a given (classified) pattern. The approximation of probability distribution mapping function of the distribution of points from the viewpoint of distances from a given point in a form of a suitable power (exponent) of a distance is presented together with a way how to state it...
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 success of any statistical steganalysis algorithm depends on the choice of features extracted and the classifier employed. This paper proposes steganalysis using random forests (SURF) employing HCS (Huffman Code Statistics) features and FR Index (ratio of File size to Resolution). The proposed algorithm is validated over an image database of over 30,000 images spanning various sizes, resolutions,...
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.