Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
The classification of imbalanced data is a well-studied topic in data mining. However, there is still a lack of understanding of the factors that make the problem difficult. In this work, we study the two main reasons that make the classification of imbalanced datasets complex: overlapping and data fracture. We present a Genetic Programming-based feature extraction method driven by Rough Set Theory...
In this paper we propose a method to build similarity relations into extended Rough Set Theory. Similarity is estimated using ideas from Granular computing and Case-base reasoning. A new measure is introduced in order to compute the quality of the similarity relation. This work presents a study of a case of a similarity relation based on a global similarity function between two objects, this function...
Outlier is strange data values that stand out from datasets. In some applications, finding outliers are more interesting than finding inliers in datasets, such as fraud detection, network system, financial and others. In this research, an algorithm is proposed to find minimum non-Reduct based on Rough set using Particle Swarm Optimization (PSO) for outlier detection. Like Genetic Algorithm (GA), PSO...
This paper proposes a new feature-selection strategy by integrating the Rough Set Theory (RST) and Particle Swarm Optimisation (PSO) algorithms to generate a set of discriminatory features for the classification problem. The proposed method is seen as a marriage between filter and wrapper approaches in which the RST is used to pre-reduce the feature set before optimisation by PSO, a meta-heuristic...
In this paper, we apply classification system denoted Belief Rough Set Classifier (BRSC) based on the hybridization of belief functions and rough sets to learn decision rules from uncertain data consisting of web usage. The uncertainty appears only in decision attributes and is handled by the Transferable Belief Model (TBM), one interpretation of the belief function theory. The web usage mining dataset...
Hyper-heuristics can be defined as search method for selecting or generating heuristics to solve difficult problem. A high level heuristic therefore operate on a set of low level heuristics with the overall aim of selecting the most suitable set of low level heuristics at a particular point in generating an overall solution. In this work, we propose a set of constructive hyper-heuristics for solving...
Attribute reduction is a basic issue in knowledge representation and data mining. It simplifies an information system by discarding some redundant attributes. In this paper, we present a hybrid approach that combines the nature of variable neighbourhood search in the first phase with an iterated local search in the second phase that always accepts best solutions. The approach is tested over 13 well-known...
Attribute reduction is one of the main issues in the theoretical research of rough set theory which is known as a NP-hard optimization problem. The objective is to find the minimal number of attributes from a large dataset. Hence it is difficult to solve to optimality. This paper proposes a composite neighbourhood structure approach to solve the attribute reduction problem that consists of two versions...
The paper is devoted to intelligent matching ontological subgraphs to concepts. The problem is considered from the point of view of rough set theory. An accuracy of approximation determines how far in a semantic space it is from a given ontological subgraph to a given concept. The approach presented in the paper can be applied to intelligent searching of a bibliographical data base for abstracts semantically...
Many existing grid authorization systems adopt an inefficient structure of storing security policies for the available resources. That leads to huge repetitions in checking security rules. One of the efficient mechanisms that handle these repetitions is the Hierarchical Clustering Mechanism (HCM) [1]. HCM reduces the redundancy in checking security rules compared to the Brute Force Approach as well...
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...
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...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.