In this paper, seven greedy heuristics for construction of association rules are compared from the point of view of the length and coverage of constructed rules. The obtained rules are compared also with optimal ones constructed by dynamic programming algorithms. The average relative difference between length of rules constructed by the best heuristic and minimum length of rules is at most 4%. The same situation is with coverage.
In the paper, an approach for decision rules construction is proposed. It is studied from the point of view of the supervised machine learning task, i.e., classification, and from the point of view of knowledge representation. Generated rules provide comparable classification results to the dynamic programming approach for optimization of decision rules relative to length or support. However, the proposed algorithm is based on transformation of decision table into entity–attribute–value (EAV) format. Additionally, standard deviation function for computation of averages’ values of attributes in particular decision classes was introduced. It allows to select from the whole set of attributes only these which provide the highest degree of information about the decision. Construction of decision rules is performed based on idea of partitioning of a decision table into corresponding subtables. In opposite to dynamic programming approach, not all attributes need to be taken into account but only these with the highest values of standard deviation per decision classes. Consequently, the proposed solution is more time efficient because of lower computational complexity. In the framework of experimental results, support and length of decision rules were computed and compared with the values of optimal rules. The classification error for data sets from UCI Machine Learning Repository was also obtained and compared with the ones for dynamic programming approach. Performed experiments show that constructed rules are not far from the optimal ones and classification results are comparable to these obtained in the framework of the dynamic programming extension.
If we speak about the Smart City’s transport system, autonomous vehicles idea is the first thing that comes to mind. Today, it is strongly believed that the autonomous vehicles’ introduction into the traffic will increase the road safety. However, driverless cars are not the solution by itself. The road safety and, accordingly, sustainability will strongly depend on decision making algorithms inbuilt into the control module. Therefore, the goal of our research is to design and test the data mining algorithm based on Entity–Attribute–Value (EAV) model for decision making in the Intelligent System in the fully- or semi-autonomous vehicles. In this article, we describe the methodology to create 3 main modules of the designed Intelligent System: (1) an Object detection module; (2) a Data analysis module; (3) a Knowledge database built on decision rules generated with the help of our data mining algorithm. To build the Decision Table on the base of the real data, we have tested our algorithm on a simple collection of photos from a Polish two-lane road. Generated rules provide comparable classification results to the dynamic programming approach for optimization of decision rules relative to length or support. However, our decision making algorithm thanks to excluding the mistakes made on the object detection stage, works faster than existing ones with the same level of correctness.