Top PDF On the evaluation of attribute information for mining classification rules

On the evaluation of attribute information for mining classification rules

On the evaluation of attribute information for mining classification rules

A two-phase approach for classification rule mining was explored in [6], where given a large training set of data tuples, the first phase, referred t o as featur[r]

8 閱讀更多

Using multi-attribute predicates for mining classification rules

Using multi-attribute predicates for mining classification rules

Note, however, that in some cases the group identity is not so dependent on the value of a single attribute. Rather, the group identity depends on the combined values of a set of attributes. This is particularly true in a database where attributes have strong dependencies among themselves. Combining several individual fea- tures is thus required for constructing multi-attribute predicates with better inference powers. In the second phase, referred to as feature combination phase , those features extracted from the rst phase are evaluated together and multi-attribute predicates with strong in- ference powers are identi ed. A technique on using match index of attributes is devised to reduce the pro- cessing cost. In essence, a match index is a heuristic indication on the combined inference power of multiple attributes, and can be used to identify uninteresting combined attributes and remove them from later pro- cessing. Note that being performed only on a subset of the training set, the feature extraction phase can be executed eciently. On the other hand, since the fea- tures extracted are used to the whole training set in the feature combination phase, the con dence of the nal classi cation rules derived can hence be ensured.
顯示更多

6 閱讀更多

Mining fuzzy association rules for classification problems

Mining fuzzy association rules for classification problems

Abstract The effective development of data mining techniques for the discovery of knowledge from training samples for classification problems in industrial engineering is necessary in applications, such as group technology. This paper proposes a learning algorithm, which can be viewed as a knowledge acquisition tool, to effectively discover fuzzy association rules for classification problems. The consequence part of each rule is one class label. The proposed learning algorithm consists of two phases: one to generate large fuzzy grids from training samples by fuzzy partitioning in each attribute, and the other to generate fuzzy association rules for classification problems by large fuzzy grids. The proposed learning algorithm is implemented by scanning training samples stored in a database only once and applying a sequence of Boolean operations to generate fuzzy grids and fuzzy rules; therefore, it can be easily extended to discover other types of fuzzy association rules. The simulation results from the iris data demonstrate that the proposed learning algorithm can effectively derive fuzzy association rules for classification problems. q 2002 Elsevier Science Ltd. All rights reserved.
顯示更多

16 閱讀更多

Elicitation of classification rules by fuzzy data mining

Elicitation of classification rules by fuzzy data mining

b Institute of Management of Technology, National Chiao Tung University, Hsinchu 300, Taiwan, ROC Received25 November 2002; receivedin revisedform 22 May 2003; accepted18 September 2003 Abstract Data mining techniques can be used to find potentially useful patterns from data and to ease the knowledge acquisition bottleneck in building prototype rule-based systems. Based on the partition methods presented in simple-fuzzy-partition-based method (SFPBM) proposed by Hu et al. (Comput. Ind. Eng. 43(4) (2002) 735), the aim of this paper is to propose a new fuzzy data mining technique consisting of two phases to findfuzzy if–then rules for classification problems: one to findfrequent fuzzy grids by using a pre-specified simple fuzzy partition method to divide each quantitative attribute, and the other to generate fuzzy classification rules from frequent fuzzy grids. To improve the classification performance of the proposed method, we specially incorporate adaptive rules proposed by Nozaki et al. (IEEE Trans. Fuzzy Syst. 4(3) (1996) 238) into our methods to adjust the confidence of each classification rule. For classification generalization ability, the simulation results from the iris data demonstrate that the proposed methodmay effectively derive fuzzy classification rules from training samples.
顯示更多

8 閱讀更多

Mining association rules with ontological information

Mining association rules with ontological information

One of the most important patterns in data mining is to discover association rules from a database. An association rule is an expression of the form, X  Y, where X and Y are sets of items. Such information is very useful in making decision for business management. In the past few years, there has been researches investigated the problem of mining association rules with classification or composition information [4][5][7], showing the benefit of incorporating domain knowledge and proposing effective algorithms.
顯示更多

4 閱讀更多

Finding fuzzy classification rules using data mining techniques

Finding fuzzy classification rules using data mining techniques

In this paper, we propose a two-phase data mining technique to discover fuzzy rules for clas- sification problems based on the Apriori algo- rithm. The first phase finds frequent fuzzy grids by dividing each quantitative attribute with a pre- specified number of various linguistic values. The second phase generates effective fuzzy classifica- tion rules from those frequent fuzzy grids. The fuzzy support and the fuzzy confidence, which have been defined previously (e.g., Ishibuchi et al., 2001a; Ishibuchi et al., 2001b; Hu et al., 2002), are employed to determine which fuzzy grids are fre- quent and which rules are effective by comparison with the minimum fuzzy support (min FS) and the minimum fuzzy confidence (min FC), respectively.
顯示更多

11 閱讀更多

RULES FOR THE CONSTRUCTION AND  CLASSIFICATION OF STEEL SHIPS 2019

RULES FOR THE CONSTRUCTION AND CLASSIFICATION OF STEEL SHIPS 2019

(3) information with respect to types of cargo carried, use of different tanks for cargo/ballast, protection of tanks and condition of coating, if any. (iii) There are three basic types of possible failure which may be the subject of technical assessment in connection with planning of surveys; corrosion, cracks and buckling. Contac t damages are not normally covered by the survey plan since indents are usually noted in memoranda and assumed to be dealt with as a normal routine by surveyors. Technical assessments performed in conjunction with the survey planning process are, in principle to be as shown schematically in Fig. I 2-1. The approach is basically an evaluation of the risk based on the knowledge and experience related to design and corrosion. The design is to be considered with respect to structural details which may be susceptible to buckling or cracking as a result of vibration, high stress levels or fatigue. Corrosion is related to the ageing process, and is closely connected with the quality of corrosion protection at newbuilding, and subsequent maintenance during the service life. Corrosion may also lead to cracking and/or buckling.
顯示更多

2092 閱讀更多

RULES FOR THE CONSTRUCTION AND  CLASSIFICATION OF STEEL SHIPS 2018

RULES FOR THE CONSTRUCTION AND CLASSIFICATION OF STEEL SHIPS 2018

(3) information with respect to types of cargo carried, use of different tanks for cargo/ballast, protection of tanks and condition of coating, if any. (iii) There are three basic types of possible failure which may be the subject of technical assessment in connection with planning of surveys; corrosion, cracks and buckling. Contact damages are not normally covered by the survey plan since indents are usually noted in memoranda and assumed to be dealt with as a normal routine by surveyors. Technical assessments performed in conjunction with the survey planning process are, in principle to be as shown schematically in Fig. I 2 -1. The approach is basically an evaluation of the risk based on the knowledge and experience related to design and corrosion. The design is to be considered with respect to structural details which may be susceptible to buckling or cracking as a result of vibration, high stress levels or fatigue. Corrosion is related to the ageing process, and is closely connected with the quality of corrosion protection at newbuilding, and subsequent maintenance during the service life. Corrosion may also lead to cracking and/or buckling.
顯示更多

1792 閱讀更多

Mining Formative Evaluation Rules Using Web-Based Learning Portfolios for Web-Based Learning Systems

Mining Formative Evaluation Rules Using Web-Based Learning Portfolios for Web-Based Learning Systems

Figure 4 gives an example to explain how to tune the membership functions by the refined value δ defined in the proposed refined K-means clustering algorithm. In Fig. 4, the circle and square notations with black and grey colors represent respectively the cluster centers determined by the K-means and refined K-means clustering algorithms. Moreover, the dotted and solid lines respectively represent the membership functions determined by the K-means and refined K-means clustering algorithms. Compared with the original K-means clustering algorithm, we find that the refined K-means clustering algorithm has benefits in terms of promoting classification ability for the boundary patterns between different classes and reducing the number of unknown patterns due to expanding the boundary range while employing the neuro-fuzzy classifier to discover the learning performance assessment rules based on learning portfolios. The later experimental results will confirm these benefits.
顯示更多

19 閱讀更多

A Study on Mining Fuzzy Association Rules and Episode Rules for Intrusion Detection 柯文元、曹偉駿

A Study on Mining Fuzzy Association Rules and Episode Rules for Intrusion Detection 柯文元、曹偉駿

[33] J. A. Marin, J., D. J. Ragsdale, and J. R. Surdu, “A Hybrid Approach to Profile Creation and Intrusion Detection,” Proceedings of the DARPA Information Survivability Conference and Exposition - DISCEX, pp. 69-76, 2001. [34] MIT Lincoln Laboratory – DARPA Intrusion Detection Evaluation, http://www.ll.mit.edu/IST?ideval/index.html, 2002. [35] L. Portnoy, E. Eskin, and S. J. Stolfo, “Intrusion Detection with Unlabeled Data Using Clustering,” Proceedings of the ACM CCS Workshop on Data Mining for Security Applications, 2001.
顯示更多

3 閱讀更多

Incremental mining of ontological association rules in evolving environments

Incremental mining of ontological association rules in evolving environments

2 Dept. of Comp. Sci. & Info. Eng., National University of Kaohsiung, Taiwan 1 clark.tseng@msa.hinet.net, 2 wylin@nuk.edu.tw Abstract. The process of knowledge discovery from databases is a knowledge intensive, highly user-oriented practice, thus has recently heralded the development of ontology-incorporated data mining techniques. In our previous work, we have considered the problem of mining association rules with ontological information (called ontological association rules) and devised two efficient algorithms, called AROC and AROS, for discovering ontological associations that exploit not only classification but also composition relationship between items. The real world, however, is not static. Data mining practitioners usually are confronted with a dynamic environment. New transactions are continually added into the database over time, and the ontology of items is evolved accordingly. Furthermore, the work of discovering interesting association rules is an iterative process; the analysts need to repeatedly adjust the constraint of minimum support and/or minimum confidence to discover real informative rules. Under these circumstances, how to dynamically discover association rules efficiently is a crucial issue. In this regard, we proposed a unified algorithm, called MIFO, which can handle the maintenance of discovered frequent patterns taking account of all evolving factors: new transactions updating in databases, ontology evolution and minimum support refinement. Empirical evaluation showed that MIFO is significantly faster than running our previous algorithms AROC and AROS from scratch.
顯示更多

10 閱讀更多

Dynamic mining of multi-supported association rules with classification ontology

Dynamic mining of multi-supported association rules with classification ontology

Abstract One of the predominant techniques used in the area of data mining is association rule mining. In real world, data mining analysts usually are confronted with a dynamic environment; the database would be changed over time, and the analysts may need to set different support constraints to discover real informative rules. Efficiently updating the discovered association rules thus becomes a crucial issue. In this paper, we consider the problem of dynamic mining of association rules with classification ontology and with non-uniform multiple minimum supports constraint. We investigate how to efficiently update the discovered association rules when there is transaction update to the database and the analyst has refined the support constraint. A novel algorithm called DMA_CO is proposed. Experimental results show that our algorithm is 14% to 80% faster than applying generalized associations mining algorithms to the whole updated database.
顯示更多

8 閱讀更多

Incremental mining of generalized association rules under classification ontology and support constraint update

Incremental mining of generalized association rules under classification ontology and support constraint update

Abstract—Mining association rules from a large business database, has been recognized as an important topic in the data mining community. A method that can help the analysis of associations is the use of classification ontology (taxonomy) and the setting of parameter constraints, such as minimum support. In real world applications, however, the classification ontology cannot be kept static while new transactions are continuously added into the original database, and the analysts may also need to set a different support constraint from the original one while formulating a new query in discovering real informative rules.
顯示更多

6 閱讀更多

Mining decision rules on data streams in the presence of concept drifts

Mining decision rules on data streams in the presence of concept drifts

c Department of Information Management, National DongHwa University, Hualien, Taiwan, ROC Abstract In a database, the concept of an example might change along with time, which is known as concept drift. When the concept drift occurs, the classification model built by using the old dataset is not suitable for predicting a new dataset. Therefore, the problem of con- cept drift has attracted a lot of attention in recent years. Although many algorithms have been proposed to solve this problem, they have not been able to provide users with a satisfactory solution to concept drift. That is, the current research about concept drift focuses only on updating the classification model. However, real life decision makers might be very interested in the rules of concept drift. For exam- ple, doctors desire to know the root causes behind variation in the causes and development of disease. In this paper, we propose a con- cept drift rule mining tree, called CDR-Tree, to accurately discover the underlying rule governing concept drift. The main contributions of this paper are: (a) we address the problem of mining concept-drifting rules which has not been considered in previously developed classification schemes; (b) we develop a method that can accurately mine rules governing concept drift; (c) we develop a method that should classification models be required, can efficiently and accurately generate such models via a simple extraction procedure rather than constructing them anew; and (d) we propose two strategies to reduce the complexity of concept-drifting rules mined by our CDR-Tree.
顯示更多

15 閱讀更多

Automated support specification for efficient mining of interesting association rules

Automated support specification for efficient mining of interesting association rules

Abstract Mining association rules from large databases of business data is an important topic in data mining. In many applications, there are explicit or implicit taxonomies (hierarchies) over the items, so it may be more useful to find associations at different levels of the taxonomy than only at the primitive concept level. Previous work on the mining of generalized association rules, however, assumed that the taxonomy of items are kept unchanged, disregarding the fact that the taxonomy might be updated as new transactions are added into the database over time. Under this circumstance, how to effectively update the discovered generalized association rules to reflect the database change with the taxonomy evolution is a crucial task. In this paper, we examine this problem and propose two novel algorithms, called IDTE and IDTE2, which can incrementally update the discovered generalized association rules when the taxonomy of items is evolved with new transactions. Empirical evaluations show that our algorithms can maintain their performance even in large amounts of incremental transactions and high degree of taxonomy evolution, and is faster than applying the contemporary generalized association mining algorithms to the whole updated database.
顯示更多

29 閱讀更多

A DIAMOND method of inducing classification rules for biological data

A DIAMOND method of inducing classification rules for biological data

(iii) Integer program hyper-plane methods: Bertsimas and Shioda [12] recently used a mixed-integer optimization method [5] to solve the classical statistical problems of classification and regression. Their method separates data points into different regions by using hyper-planes. Each region is assigned a class during the classification. Solving this mixed-integer program, the rules with high rate of accuracy can be induced. However, this approach may generate too many polyhedral regions, which decrease the rate of compact in the induced rules. Using integer programming techniques, Li and Chen [5] developed a multiple criteria method to induce classification rules. Their method clusters data points into polyhedral regions, and yield highly accurate. However, since their approach is based on the concept
顯示更多

13 閱讀更多

Classification of Research Results on Information Systems Alignment

Classification of Research Results on Information Systems Alignment

argued that the two dimensions are inseparable in most of real world cases because managers behave according to their thinking. In comparison, the behavioral dimension has been adopted frequently in the alignment literature, and more focus should be added to the cognitive dimension to enrich the assessment of alignment. Table 1

32 閱讀更多

Perfect Hashing Schemes for Mining Association Rules

Perfect Hashing Schemes for Mining Association Rules

摘要: Hashing schemes are widely used to improve the performance of data mining association rules, as in the DHP algorithm that utilizes the hash table in identifying the validity of candidate itemsets according to the number of the table's bucket accesses. However, since the hash table used in DHP is plagued by the collision problem, the process of

1 閱讀更多

Fuzzy data mining for interesting generalized association rules

Fuzzy data mining for interesting generalized association rules

Transactions with quantitative values and items with hierarchy relation are, however, commonly seen in real-world applications. In this paper, we introduce the problem of mining generalized association rules for quantitative values. We propose fuzzy generalized rules mining algorithm for extracting implicit knowledge from transactions stored as quantitative values. Given a set of transaction and predefined taxonomy, we want to find fuzzy generalized association rules where the quantitative of items may be from any level of the taxonomy. Each item uses only the linguistic term with the maximum cardinality in later mining processes, thus making the number of fuzzy regions to be processed the same as that of the original items. The algorithm can therefore focus on the most important linguistic terms and reduce its time complexity. We propose algorithm combines fuzzy transaction data mining algorithm and mining generalized association rules algorithm. This paper related to set concepts, fuzzy data mining algorithms and taxonomy and generalized association rules.
顯示更多

33 閱讀更多

A machine learning approach for acquiring descriptive classification rules of shape contours

A machine learning approach for acquiring descriptive classification rules of shape contours

Ueda and Suzuki (4) retained perceptually relevant features in shapes to learn shape models. These results show that machine learning techniques really help the tas[r]

8 閱讀更多

Show all 10000 documents...