Attribute Oriented Induction

Summary The attribute-oriented induction (AOI) method is a useful tool for data capable of extracting generalized knowledge from relational data and the user's background knowledge. However, a potential weakness of AOI is that it only provides a snapshot of generalized knowledge, not a global picture. In addition, the method only mined knowledge from positive facts in databases. Rare but important negative generalized knowledge can be missed. Hence, the aim of this study is to proposal two novel mining approaches to generate multiple-level positive and negative generalized knowledge. The approaches discussed in this paper are more flexible and powerful than currently utilized methods and can be expected to have wide applications in diverse areas including e- commerce, e-learning, library science, and so on.

AOI-HEP (Attribute Oriented Induction High Emerging Pattern) as new data mining technique has been success to mine frequent pattern and is extended to mine similar patterns. AOI-HEP is success to mine 3 and 1 similar patterns from IPUMS and breast cancer UCI machine learning datasets respectively. Meanwhile, the experiments showed that there was no finding similar patterns on adult and census UCI machine learning datasets. The experiments showed that finding AOI-HEP similar pattern in dataset is influenced by learning on chosen high level concept attribute in concept hierarchy and it is applied to AOI-HEP frequent pattern in previous research as well. The experiments chosed high level concept attributes such as workclass, clump thickness, means and marts for adult, breast cancer, census and IPUMS datasets respectively. In order to proof that the chosen high level concept attribute will influences the AOI-HEP similar pattern in dataset, then extended experiments were carried on and the finding were census dataset which had been none AOI-HEP similar pattern, had AOI-HEP similar pattern when learned on high level concept in marital attribute. Meanwhile, Breast cancer which had been had 1 AOI-HEP similar pattern, had none AOI-HEP similar pattern when learned on high level concept in attributes such as cell size, cell shape and bare nuclei. The 2 of 3 finding Similar patterns in IPUMS dataset have strong discriminant rule since having large growth rates such as 1.53% and 3.47%, and having large supports in target dataset such as 4.54% and 5.45 respectively. Moreover, there have small supports in contrasting dataset such as 2.96% and 1.57% respectively.

This paper will propose a novel star schema attribute induction as a new attribute induction paradigm and as improving from current attribute oriented induction. A novel star schema attribute induction will be examined with current attribute oriented induction based on characteristic rule and using non rule based concept hierarchy by implementing both of approaches. In novel star schema attribute induction some improvements have been implemented like elimination threshold number as maximum tuples control for generalization result, there is no ANY as the most general concept, replacement the role concept hierarchy with concept tree, simplification for the generalization strategy steps and elimination attribute oriented induction algorithm. Novel star schema attribute induction is more powerful than the current attribute oriented induction since can produce small number final generalization tuples and there is no ANY in the results.

The development of efficient algorithms for learning from large relational databases is an important task in applicative machine learning. In this paper, we study knowledge discovery in relational databases and develop an attribute-oriented learning method which extracts generalization rules from relational databases. The method adopts the artificial intelligence "learning-from-examples" paradigm and applies in the learning process an attribute-oriented concept tree ascending technique which integrates database operations with the learning process and provides a simple and efficient way of learning from databases. The method learns both characteristic rules and classification rules of a learning concept, where a characteristic rule characterizes the properties shared by all the facts of the class being learned; while a classification rule characterizes the properties that distinguish the class being learned from other classes. The learning result could be a conjunctive rule or a rule with a small number of Jisjuncts. Moreover, learning can be performed with databases containing noisy data and exceptional cases using database statistics. Our analysis of the algorithms shows that attributeoriented induction substantially reduces the computational complexity of the database learning process.

In this paper, a prototype of a Decision Support System (DSS) is proposed for providing the knowledge for optimizing the newly adopted e-learning education strategy in educational institutions. If an educational institution adopted e-learning as a new strategy, it should undertake a preliminary evaluation to determine the percentage of success and areas of weakness of this strategy. If this evaluation is done manually, it would not be an easy task to do and would not provide knowledge about all pitfall symptoms. The proposed DSS is based on exploration (mining) of knowledge from large amounts of data yielded from the operating the institution to its business. This knowledge can be used to guide and optimize any new business strategy implemented by the institution. The proposed DSS involves Database engine, Data Mining engine and Artificial Intelligence engine. All these engines work together in order to extract the knowledge necessary to improve the effectiveness of any strategy, including e-learning

Classification is widely used technique in the data mining domain, where scalability and efficiency are the immediate problems in classification algorithms for large databases. We suggest improvements to the existing C4.5 decision tree algorithm. In this paper attribute oriented induction (AOI) and relevance analysis are incorporated with concept hierarchy"s knowledge and HeightBalancePriority algorithm for construction of decision tree along with Multi level mining. The assignment of priorities to attributes is done by evaluating information entropy, at different levels of abstraction for building decision tree using HeightBalancePriority algorithm. Modified DMQL queries are used to understand and explore the shortcomings of the decision trees generated by C4.5 classifier for education dataset and the results are compared with the proposed approach.

Classification is widely used technique in the data mining domain, where scalability and efficiency are the immediate problems in classification algorithms for large databases. We suggest improvements to the existing C4.5 decision tree algorithm. In this paper attribute oriented induction (AOI) and relevance analysis are incorporated with concept hierarchy"s knowledge and HeightBalancePriority algorithm for construction of decision tree along with Multi level mining. The assignment of priorities to attributes is done by evaluating information entropy, at different levels of abstraction for building decision tree using HeightBalancePriority algorithm. Modified DMQL queries are used to understand and explore the shortcomings of the decision trees generated by C4.5 classifier for education dataset and the results are compared with the proposed approach.

AOI-HEP (Attribute Oriented Induction High Emerging Pattern) as new data mining technique has been success to mine frequent pattern and is extended to mine similar patterns. AOI-HEP is success to mine 3 and 1 similar patterns from IPUMS and breast cancer UCI machine learning datasets respectively. Meanwhile, the experiments showed that there was no finding similar patterns on adult and census UCI machine learning datasets. The experiments showed that finding AOI-HEP similar pattern in dataset is influenced by learning on chosen high level concept attribute in concept hierarchy and it is applied to AOI-HEP frequent pattern in previous research as well. The experiments chosed high level concept attributes such as workclass, clump thickness, means and marts for adult, breast cancer, census and IPUMS datasets respectively. In order to proof that the chosen high level concept attribute will influences the AOI-HEP similar pattern in dataset, then extended experiments were carried on and the finding were census dataset which had been none AOI-HEP similar pattern, had AOI-HEP similar pattern when learned on high level concept in marital attribute. Meanwhile, Breast cancer which had been had 1 AOI-HEP similar pattern, had none AOI-HEP similar pattern when learned on high level concept in attributes such as cell size, cell shape and bare nuclei. The 2 of 3 finding Similar patterns in IPUMS dataset have strong discriminant rule since having large growth rates such as 1.53% and 3.47%, and having large supports in target dataset such as 4.54% and 5.45 respectively. Moreover, there have small supports in contrasting dataset such as 2.96% and 1.57% respectively.

Classification is widely used technique in the data mining domain, where scalability and efficiency are the immediate problems in classification algorithms for large databases. We suggest improvements to the existing C4.5 decision tree algorithm. In this paper attribute oriented induction (AOI) and relevance analysis are incorporated with concept hierarchy's knowledge and HeightBalancePriority algorithm for construction of decision tree along with Multi level mining. The assignment of priorities to attributes is done by evaluating information entropy, at different levels of abstraction for building decision tree using HeightBalancePriority algorithm. Modified DMQL queries are used to understand and explore the shortcomings of the decision trees generated by C4.5 classifier for education dataset and the results are compared with the proposed approach.

Finding interesting rule in the sixth strategy step about threshold control on generalized relations in attribute oriented induction, there is possibility to select candidate attribute for further generalization and merging of identical tuples until the number of tuples is no greater than the threshold value, as implemented in basic attribute oriented induction algorithm. At this strategy step there is possibility the number of tuples in final generalization result still greater than threshold value. In order to get the final generalization result which only small number of tuples and can be easy to transfer into simple logical formula, the seventh strategy step about rule transformation is evolved where there will be simplification by unioning or grouping the identical attribute. Our approach to measure interesting rule is opposite with heuristic measurement approach by Fudger and Hamilton where the more complex concept hierarchies, more interesting results are likely to be found, ...

A simple sql statement can be used to search learning or rule in relational database for data mining purposes particularly for classification rule. With just only one simple sql statement, characteristic and classification rule can be created simultaneously. Collaboration sql statement with any other application software will increase the ability for creating t-weight as measurement the typicality of each record in the characteristic rule and d-weight as measurement the discriminating behavior of the learned classification/discriminant rule, specifically for further generalization in characteristic rule. Handling concept hierarchy into tables based on concept tree will influence for the successful simple sql statement and by knowing the right standard knowledge to transform each of concept tree in concept hierarchy into one table as to transform concept hierarchy into table, the simple sql statement can be run properly.

Attribute Oriented Induction High level Emerging Pattern (AOI-HEP) is a novel idea which is influenced by Attribute Oriented Induction (AOI) and Emerging Pattern (EP). AOI-HEP discovers patterns such as Total Subsumption HEP (TSHEP), Subsumption Overlapping HEP (SOHEP) and Total Overlapping HEP (TOHEP), include frequent and similar patterns. Mining TSHEP, SOHEP, TOHEP, frequent and similar patterns for each dataset is influenced by learning on high level concept in one of chosen attribute. The experiments used four datasets from UCI machine learning repository and most datasets have SOHEP but not TSHEP and TOHEP and the most rarely found were TOHEP. There are total twenty two High level Emerging Pattern (HEP) where four HEP are TSHEP, sixteen HEP are SOHEP and two HEP are TOHEP, and there are five frequent and four similar patterns from the experiments. Moreover, the experiment showed that adult and breast cancer datasets are interested to mine frequent pattern while breast cancer a...

The Concept Hierarchy in attribute oriented induction is a powerful tool for saving the knowledge hierarchy in data, which will be then used to generalize mining rules for data mining. Database design influences the performance applications when reading records in database. When building the database table the allocation of fields will be decided by the lowest and the highest concept within the concept tree. Additionally, the number of hierarchy concept levels in a concept tree will decide the quantity of fields in the table. The number of record tables will be decided by the number of the lowest concepts in concept tree. For numeric values the treatment is different. For efficiency reasons the number of created table records will instead depend on the amount of concepts at the next generalization. All the tables from concept trees will become dimensional tables and the data table will become a fact table. All these tables in fact create a star schema. The Star schema is recognized as data warehouse schema for multidimensional analysis, and will give value add for attribute oriented induction for multidimensional purposes.

Searching learning or rules in relational database for data mining purposes with characteristic or classification/discriminant rule in attribute oriented induction technique can be quicker, easy, and simple with simple SQL statement. With just only one simple SQL statement, characteristic and classification rule can be created simultaneously. Collaboration SQL statement with any other application software will increase the ability for creating t-weight as measurement the typicality of each record in the characteristic rule and d-weight as measurement the discriminating behavior of the learned classification/discriminant rule, particularly for further generalization in characteristic rule. Handling concept hierarchy into tables based on concept tree will influence for the successful simple SQL statement and by knowing the right standard knowledge to transform each of concept tree in concept hierarchy into one table as transforming concept hierarchy into table, the simple SQL statemen...

This paper will propose a novel star schema attribute induction as a new attribute induction paradigm and as improving from current attribute oriented induction. A novel star schema attribute induction will be examined with current attribute oriented induction based on characteristic rule and using non rule based concept hierarchy by implementing both of approaches. In novel star schema attribute induction some improvements have been implemented like elimination threshold number as maximum tuples control for generalization result, there is no ANY as the most general concept, replacement the role concept hierarchy with concept tree, simplification for the generalization strategy steps and elimination attribute oriented induction algorithm. Novel star schema attribute induction is more powerful than the current attribute oriented induction since can produce small number final generalization tuples and there is no ANY in the results.

Finding interesting rule in the sixth strategy step about threshold control on generalized relations in attribute oriented induction, there is possibility to select candidate attribute for further generalization and merging of identical tuples until the number of tuples is no greater than the threshold value, as implemented in basic attribute oriented induction algorithm. At this strategy step there is possibility the number of tuples in final generalization result still greater than threshold value. In order to get the final generalization result which only small number of tuples and can be easy to transfer into simple logical formula, the seventh strategy step about rule transformation is evolved where there will be simplification by unioning or grouping the identical attribute. Our approach to measure interesting rule is opposite with heuristic measurement approach by Fudger and Hamilton where the more complex concept hierarchies, more interesting results are likely to be found, ...

This paper will propose a novel star schema attribute induction as a new attribute induction paradigm and as improving from current attribute oriented induction. A novel star schema attribute induction will be examined with current attribute oriented induction based on characteristic rule and using non rule based concept hierarchy by implementing both of approaches. In novel star schema attribute induction some improvements have been implemented like elimination threshold number as maximum tuples control for generalization result, there is no ANY as the most general concept, replacement the role concept hierarchy with concept tree, simplification for the generalization strategy steps and elimination attribute oriented induction algorithm. Novel star schema attribute induction is more powerful than the current attribute oriented induction since can produce small number final generalization tuples and there is no ANY in the results.

A simple sql statement can be used to search learning or rule in relational database for data mining purposes particularly for classification rule. With just only one simple sql statement, characteristic and classification rule can be created simultaneously. Collaboration sql statement with any other application software will increase the ability for creating t-weight as measurement the typicality of each record in the characteristic rule and d-weight as measurement the discriminating behavior of the learned classification/discriminant rule, specifically for further generalization in characteristic rule. Handling concept hierarchy into tables based on concept tree will influence for the successful simple sql statement and by knowing the right standard knowledge to transform each of concept tree in concept hierarchy into one table as to transform concept hierarchy into table, the simple sql statement can be run properly.

This paper will propose a novel star schema attribute induction as a new attribute induction paradigm and as improving from current attribute oriented induction. A novel star schema attribute induction will be examined with current attribute oriented induction based on characteristic rule and using non rule based concept hierarchy by implementing both of approaches. In novel star schema attribute induction some improvements have been implemented like elimination threshold number as maximum tuples control for generalization result, there is no ANY as the most general concept, replacement the role concept hierarchy with concept tree, simplification for the generalization strategy steps and elimination attribute oriented induction algorithm. Novel star schema attribute induction is more powerful than the current attribute oriented induction since can produce small number final generalization tuples and there is no ANY in the results.

Searching learning or rules in relational database for data mining purposes with characteristic or classification/discriminant rule in attribute oriented induction technique can be quicker, easy, and simple with simple SQL statement. With just only one simple SQL statement, characteristic and classification rule can be created simultaneously. Collaboration SQL statement with any other application software will increase the ability for creating t-weight as measurement the typicality of each record in the characteristic rule and d-weight as measurement the discriminating behavior of the learned classification/discriminant rule, particularly for further generalization in characteristic rule. Handling concept hierarchy into tables based on concept tree will influence for the successful simple SQL statement and by knowing the right standard knowledge to transform each of concept tree in concept hierarchy into one table as transforming concept hierarchy into table, the simple SQL statement can be run properly.

Attribute-oriented induction (AOI) is a useful data mining method for extracting generalized knowledge from relational data and users' background knowledge. Concept hierarchies can be integrated with the AOI method to induce multi-level generalized knowledge. However, the existing AOI approaches are only capable of mining positive knowledge from databases; thus, rare but important negative generalized knowledge that is unknown, unexpected, or contradictory to what the user believes, can be missed. In this study, we propose a global negative attribute-oriented induction (GNAOI) approach that can generate comprehensive and multiple-level negative generalized knowledge at the same time. Two pruning properties, the downward level closure property and the upward superset closure property, are employed to improve the efficiency of the algorithm, and a new interest measure, nim(cl), is exploited to measure the degree of the negative relation. Experiment results from a real-life dataset show that the proposed method is effective in finding global negative generalized knowledge.

A simple sql statement can be used to search learning or rule in relational database for data mining purposes particularly for classification rule. With just only one simple sql statement, characteristic and classification rule can be created simultaneously. Collaboration sql statement with any other application software will increase the ability for creating t-weight as measurement the typicality of each record in the characteristic rule and d-weight as measurement the discriminating behavior of the learned classification/discriminant rule, specifically for further generalization in characteristic rule. Handling concept hierarchy into tables based on concept tree will influence for the successful simple sql statement and by knowing the right standard knowledge to transform each of concept tree in concept hierarchy into one table as to transform concept hierarchy into table, the simple sql statement can be run properly.

Data Mining is the process of discovering interesting knowledge (patterns) from large amounts of data stored either in databases, data warehouses, or other information repositories. Multimedia data mining is the mining of high-level multimedia information and knowledge from large multimedia databases. Mining multimedia data is, however, at an experimental stage. Substantial progress in the field of data mining and data warehousing research has been witnessed in the last few years. Numerous research and commercial systems for data mining and data warehousing have been developed for mining knowledge in relational database and data warehouses (Fayyad et al., 1996) Despite the fact that Multimedia has been the major focus for many researchers around the world, data mining from multimedia databases is still in its infancy, multimedia mining still seem shy on results. Many techniques for representing, storing, indexing and retrieving multimedia data have been proposed. However, rare are t...

The Concept Hierarchy in attribute oriented induction is a powerful tool for saving the knowledge hierarchy in data, which will be then used to generalize mining rules for data mining. Database design influences the performance applications when reading records in database. When building the database table the allocation of fields will be decided by the lowest and the highest concept within the concept tree. Additionally, the number of hierarchy concept levels in a concept tree will decide the quantity of fields in the table. The number of record tables will be decided by the number of the lowest concepts in concept tree. For numeric values the treatment is different. For efficiency reasons the number of created table records will instead depend on the amount of concepts at the next generalization. All the tables from concept trees will become dimensional tables and the data table will become a fact table. All these tables in fact create a star schema. The Star schema is recognized ...

Mining data in human activity life such as business, education, engineering, health and so on, is important and help human itself in order to justify their decision making process. Attribute Oriented Induction (AOI) has been using to mine significant different patterns since was coined in 1989, has been combined and as complement with other data mining pattern. AOI has been proved and powerful, has future opportunity to be explored in order to help human life to find data patterns. AOI is chosen since can reduce many patterns by summarize/roll up many patterns in low into high level in concept tree/hierarchy. However, non summarize pattern at low level in concept tree/hierarchy can be used to sharpen the mining knowledge pattern just as like roll up and drill down in data warehouse. Mapping implementation of AOI in human life area such as business, education, engineering, health and so on, is useful in order to give valuable knowledge AOI mining pattern, particularly for those who interest with AOI data mining technique as data mining technique which can summarize many pattern into simple patterns.

Knowledge discovery in databases, or data mining, is an important issue in the development of data-and knowledge-base systems. An attribute-oriented induction method has been developed for knowledge discovery in databases. The method integrates a machine learning paradigm, especially learning-from-examples techniques, with set-oriented database operations and extracts generalized data from actual data in databases. An attribute-oriented concept tree ascension technique is applied in generalization, which substantially reduces the computational complex@ of database learning processes. Different kinas of knowledge rules, including characteristic rules, discrimination rules, quantitative rules, and data evolution regularities can be discovered efficiently using the attribute-oriented approach. In addition to learning in relational databases, the approach can be applied to knowledge discovery in nested relational and deductive databases. Learning can also be performed with databases containing noisy data and exceptional cases using database statistics. Furthermore, the rules discovered can be used to query database knowledge, answer cooperative queries and facilitate semantic query optimization. Based upon these principles, a prototyped database learning system, DBLEARN, has been constructed for experimentation.

Searching learning or rules in relational database for data mining purposes with characteristic or classification/discriminant rule in attribute oriented induction technique can be quicker, easy, and simple with simple SQL statement. With just only one simple SQL statement, characteristic and classification rule can be created simultaneously. Collaboration SQL statement with any other application software will increase the ability for creating t-weight as measurement the typicality of each record in the characteristic rule and d-weight as measurement the discriminating behavior of the learned classification/discriminant rule, particularly for further generalization in characteristic rule. Handling concept hierarchy into tables based on concept tree will influence for the successful simple SQL statement and by knowing the right standard knowledge to transform each of concept tree in concept hierarchy into one table as transforming concept hierarchy into table, the simple SQL statement can be run properly.

This paper will propose a novel star schema attribute induction as a new attribute induction paradigm and as improving from current attribute oriented induction. A novel star schema attribute induction will be examined with current attribute oriented induction based on characteristic rule and using non rule based concept hierarchy by implementing both of approaches. In novel star schema attribute induction some improvements have been implemented like elimination threshold number as maximum tuples control for generalization result, there is no ANY as the most general concept, replacement the role concept hierarchy with concept tree, simplification for the generalization strategy steps and elimination attribute oriented induction algorithm. Novel star schema attribute induction is more powerful than the current attribute oriented induction since can produce small number final generalization tuples and there is no ANY in the results.

In this paper we are going to present the concept of distributed data mining and the advantages of combined architecture which involves the concept of distribution as a backbone and the process of mining. To demonstrate the Distributed Data Mining concept we are presenting architecture with various levels of users, data, and networks. In this we also have had the usage of DMQL (Distributed Mining Query Language) and converter mechanism. After getting the required data we mentioned the security layer in the architecture so as to oppose the malicious software or data.

Knowledge discovery in databases, or data mining, is an important issue in the development of data-and knowledge-base systems. An attribute-oriented induction method has been developed for knowledge discovery in databases. The method integrates a machine learning paradigm, especially learning-from-examples techniques, with set-oriented database operations and extracts generalized data from actual data in databases. An attribute-oriented concept tree ascension technique is applied in generalization, which substantially reduces the computational complex@ of database learning processes. Different kinas of knowledge rules, including characteristic rules, discrimination rules, quantitative rules, and data evolution regularities can be discovered efficiently using the attribute-oriented approach. In addition to learning in relational databases, the approach can be applied to knowledge discovery in nested relational and deductive databases. Learning can also be performed with databases containing noisy data and exceptional cases using database statistics. Furthermore, the rules discovered can be used to query database knowledge, answer cooperative queries and facilitate semantic query optimization. Based upon these principles, a prototyped database learning system, DBLEARN, has been constructed for experimentation.