Triggering Uttermost Escalated Patterns for Refined Clustering

International Journal of Computer Trends and Technology (IJCTT)          
© 2015 by IJCTT Journal
Volume-22 Number-2
Year of Publication : 2015
Authors : Garima Singh, Mrs. Suraiya Parveen (A.P)


Garima Singh, Mrs. Suraiya Parveen (A.P) "Triggering Uttermost Escalated Patterns for Refined Clustering". International Journal of Computer Trends and Technology (IJCTT) V22(2):99-102, April 2015. ISSN:2231-2803. Published by Seventh Sense Research Group.

Abstract -
The clustering algorithm, so far, are inefficient in finding interested patterns as they reckon on the position of data items which results in large number of illegitimate patterns. The generated illegitimate patterns have low association between them providing knowledge which is of nominal significance to the user. The existing algorithm results in poor propensity among the data items. To perform the excerption of escalated patterns, the proposed algorithm uses a nominal threshold value as decided by the user. The escalated patterns will be excerpted using E-confidence and mining for knowledge will be applied on these patterns. The resulting data patterns have high propensity amid them. Thus providing the utmost knowledge to the user.

[1] Fisher, R.A.: The Use of Multiple Measurements in Taxonomic Problems, Annals of Eugenics, vol. 7, 1936, pp. 179188.
[2] Omiecinski, Edward R.; Alternative interest measures for mining associations in databases, IEEE Transactions on Knowledge and Data Engineering, 15(1):57-69, Jan/Feb 2003
[3] D. Burdick, M. Calimlim, and J.Gehrke. Mafia: A maximal frequent itemset algorithm for transactional databases. In Proc. Of the ICDE,200.
[4] H. Xiong, P. Tan, and V. Kumar. Mining hyperclique patterns with confidence pruning. In Technical Report 03-006 Computer Science, Univ. of Minnesota., Jan 2003.
[5] Syed Zubair Ahmad Shah, Preceding Clustering by Pattern Preservation. In VSRD-IJCSIT,Vol. 2 (8), 2012
[6] E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, and C. Yang. Finding interesting associations without support pruning. In ICDE, 2000.
[7] K. Wang, Y. He, D. Cheung, and Y. Chin. Mining confident rules without support requirement. In ACM CIKM, 2001.

Escalated patterns, nominal threshold, illegitimate patterns, propensity.