74,639 research outputs found
Attribute Set Weighting and Decomposition Approaches for Reduct Computation
This research is mainly in the Rough Set theory based knowledge reduction for data classification within the data mining framework. To facilitate the Rough Set based
classification, two main knowledge reduction models are proposed. The first model is an approximate approach for object reducts computation used particularly for the
data classification purposes. This approach emphasizes on assigning weights for each attribute in the attributes set. The weights give indication for the importance of an
attribute to be considered in the reduct. This proposed approach is named Object Reduct by Attribute Weighting (ORAW). A variation of this approach is proposed to
compute full reduct and named Full Reduct by Attribute Weighting (FRAW).The second proposed approach deals with large datasets particularly with large number of attributes. This approach utilizes the principle of incremental attribute set decomposition to generate an approximate reduct to represent the entire dataset. This
proposed approach is termed for Reduct by Attribute Set Decomposition (RASD).The proposed reduct computation approaches are extensively experimented and
evaluated. The evaluation is mainly in two folds: first is to evaluate the proposed
approaches as Rough Set based methods where the classification accuracy is used as
an evaluation measure. The well known IO-fold cross validation method is used to
estimate the classification accuracy. The second fold is to evaluate the approaches as
knowledge reduction methods where the size of the reduct is used as a reduction
measure. The approaches are compared to other reduct computation methods and to other none Rough Set based classification methods. The proposed approaches are applied to various standard domains datasets from the UCI repository. The results of the experiments showed a very good performance for the proposed approaches as classification methods and as knowledge reduction methods. The accuracy of the ORAW approach outperformed the Johnson approach over all the datasets. It also produces better accuracy over the Exhaustive and the Standard Integer Programming (SIP) approaches for the majority of the datasets used in the experiments. For the RASD approach, it is compared to other classification methods and it shows very competitive results in term of classification accuracy and reducts size. As a conclusion, the proposed approaches have shown competitive and even better accuracy in most tested domains. The experiment results indicate that the proposed approaches as Rough classifiers give good performance across different classification problems and they can be promising methods in solving classification problems. Moreover, the experiments proved that the incremental vertical decomposition framework is an appealing method for knowledge reduction over large datasets within the framework of Rough Set based classification
Going Deeper than Supervised Discretisation in Processing of Stylometric Features
Rough set theory is employed in cases where data are incomplete and inconsistent and an ap- proximation of concepts is needed. The classical approach works for discrete data and allows only nominal classification. To induce the best rules, access to all available information is ad- vantageous, which can be endangered if discretisation is a necessary step in the data preparation stage. Discretisation, even executed with taking into account class labels of instances, brings some information loss. The research methodology illustrated in this paper is dedicated to ex- tended transformations of continuous input features into categorical, with the goal of enhancing the performance of rule-based classifiers, constructed with rough set data mining. The experi- ments were carried out in the stylometry domain, with its key task of authorship attribution. The obtained results indicate that supporting supervised discretisation with elements of unsuper- vised transformations can lead to enhanced predictions, which shows the merits of the proposed research framework
A Distributed Clustering Approach for Heterogeneous Environments Using Fuzzy Rough Set Theory
Vast majority of data mining algorithms have been designed to work on centralized data, unfortunately however, almost all of nowadays data sets are distributed both geographically and conceptually. Due to privacy and computation cost, centralizing distributed data sets before analyzing them is undoubtedly impractical. In this paper, we present a framework for clustering distributed data which takes into account privacy and computation cost. To do that, we remove uncertain instances and just send the label of the other instances to the central location. To remove the uncertain instances, we develop a new instance weighting method based on fuzzy and rough set theory. The achieved results on well-known data verify effectiveness of the proposed method compared to previous works
An intelligent recommendation system framework for student relationship management
In order to enhance student satisfaction, many services have been provided in order to meet student needs. A recommendation system is a significant service which can be used to assist students in several ways. This paper proposes a conceptual framework of an Intelligent Recommendation System in order to support Student Relationship Management (SRM) for a Thai private university. This article proposed the system architecture of an Intelligent Recommendation System (IRS) which aims to assist students to choose an appropriate course for their studies. Moreover, this study intends to compare different data mining techniques in various recommendation systems and to determine appropriate algorithms for the proposed electronic Intelligent Recommendation System (IRS). The IRS also aims to support Student Relationship Management (SRM) in the university. The IRS has been designed using data mining and artificial intelligent techniques such as clustering, association rule and classification
A comparative study of the AHP and TOPSIS methods for implementing load shedding scheme in a pulp mill system
The advancement of technology had encouraged mankind to design and create useful
equipment and devices. These equipment enable users to fully utilize them in various
applications. Pulp mill is one of the heavy industries that consumes large amount of
electricity in its production. Due to this, any malfunction of the equipment might
cause mass losses to the company. In particular, the breakdown of the generator
would cause other generators to be overloaded. In the meantime, the subsequence
loads will be shed until the generators are sufficient to provide the power to other
loads. Once the fault had been fixed, the load shedding scheme can be deactivated.
Thus, load shedding scheme is the best way in handling such condition. Selected load
will be shed under this scheme in order to protect the generators from being
damaged. Multi Criteria Decision Making (MCDM) can be applied in determination
of the load shedding scheme in the electric power system. In this thesis two methods
which are Analytic Hierarchy Process (AHP) and Technique for Order Preference by
Similarity to Ideal Solution (TOPSIS) were introduced and applied. From this thesis,
a series of analyses are conducted and the results are determined. Among these two
methods which are AHP and TOPSIS, the results shown that TOPSIS is the best
Multi criteria Decision Making (MCDM) for load shedding scheme in the pulp mill
system. TOPSIS is the most effective solution because of the highest percentage
effectiveness of load shedding between these two methods. The results of the AHP
and TOPSIS analysis to the pulp mill system are very promising
Rough Sets Clustering and Markov model for Web Access Prediction
Discovering user access patterns from web access log is increasing the importance of information to build up adaptive web server according to the individual user’s behavior. The variety of user behaviors on accessing information also grows, which has a great impact on the network utilization. In this paper, we present a rough set clustering to cluster web transactions from web access logs and using Markov model for next access prediction. Using this approach, users can effectively mine web log records to discover and predict access patterns. We perform experiments using real web trace logs collected from www.dusit.ac.th servers. In order to improve its prediction ration, the model includes a rough sets scheme in which search similarity measure to compute the similarity between two sequences using upper approximation
- …