Search

Data mining has become a relatively modern platform for information retrieval. The efficient data mining techniques can increase the reliability and accuracy of internal auditing for the various community even while lowering audit risk. Existing audit data mining approaches lack significant identification of hidden connections and interactions in bid data platforms. Hence, this study extends the literature survey on the signification of audit data mining in multiple applications. This survey identifies the scope of improved association algorithms in audit data mining, a rule-based machine learning approach to determine the exciting relationship among variables in large audit datasets. Therefore, a Conceptual Framework of Improved Association Algorithm (CFiAA) and its application in audit data mining is proposed. This study examines the strengths and weaknesses of the proposed CFiAA in audit mining. The proposed model has been trained using an audit data set and validates with various audit datasets. Finally, this paper presents the comparative analysis of the proposal to show its highest performance related to existing models. Thus, CFiAA scores the performance ratio of 94.5%, accuracy ratio of 92.4%, an efficiency ratio of 92.5%, F1 measure of 91.8%, error rate 32.5%, prediction ratio of 93.7%, and the precision ratio of 92.5% compared to existing models. [ABSTRACT FROM AUTHOR]

There are various applications of clustering in the fields of machine learning, data mining, data compression along with pattern recognition. The existent techniques like the Llyods algorithm (sometimes called k-means) were affected by the issue of the algorithm which converges to a local optimum along with no approximation guarantee. For overcoming these shortcomings, an efficient k-means clustering approach is offered by this paper for stream data mining. Coreset is a popular and fundamental concept for k-means clustering in stream data. In each step, reduction determines a coreset of inputs, and represents the error, where P represents number of input points according to nested property of coreset. Hence, a bit reduction in error of final coreset gets n times more accurate. Therefore, this motivated the author to propose a new coreset-reduction algorithm. The proposed algorithm executed on the Covertype dataset, Spambase dataset, Census 1990 dataset, Bigcross dataset, and Tower dataset. Our algorithm outperforms with competitive algorithms like Streamkm++, BICO (BIRCH meets Coresets for k-means clustering), and BIRCH (Balance Iterative Reducing and Clustering using Hierarchies. [ABSTRACT FROM AUTHOR]