THE EFFECTIVE UTILITY OF ATTRIBUTES WITH THRESHOLD BASED COLLABORATION WITH COMBINATIONAL TUPLES IN DATA MINING
Main Article Content
Abstract
In data mining utilization of attributes with based on the threshold with respect to the generated attributed weightages and producing the pattern of utilities is a huge challenge. Generally the patterns here are the seed and also results, So by considering the existing data pattern mining techniques cannot estimate which weightage belongs to which item and also its not possible to get the combinational attributes with the given threshold[4]. also. So to overcome this issue this work proposed an efficient framework called Threshold Based collaboration with Combinational tuples(TBCT). This approach reduces the complex pattern making with critical dataset which is in the form of structured pattern with proper assigned weightages in the linear passion. The utility of the pattern is with respect to novel approach[9] and non-random tuple formation but with considering the threshold as a seed segment[12].The novel model is used for efficient and effective fetching of the dataset. The flow of this approach when tuples are framing parellally the weightages will be collaborated to reach the threshold segment. Once the tuple combination is fully qualified with respect to segment the TBCT will utilize this to increase with additional tuple combinations till it reaches the maximum utilization and fully qualified patterns without ignoring any single or multiple combinational tuples or pattern with novel approach.
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.
References
C. Creighton and S. Hanash, “Mining Gene Expression Databases for Association Rules,†Bioinformatics, vol. 19,no. 1, pp. 79-86, 2003.
M.Y. Eltabakh, M. Ouzzani, M.A. Khalil, W.G. Aref,
Deepa V Patil et al, International Journal of Advanced Research in Computer Science, 9 (Special Issue III), May 2018, 41-44
Conference Paper: Third National Conference on “Advances in Computing and Information Technology†Organized by: School of Computing and Information Technology, REVA University, Bengaluru, India 44
and A.K. Elmagarmid, “Incremental Mining for Frequent Patterns in Evolving Time Series Databases,†Technical Report CSD TR#0802, Purdue Univ., 2008.
Erwin, R.P. Gopalan, and N.R. Achuthan, “Efficient Mining of High Utility Itemsets from Large Data Sets,†Proc.12th Pacific-Asia Conf. Advances in Knowledge Discovery and Data Mining (PAKDD), pp. 554-561, 2008.
Y. Liu, W. Liao and A. Choudhary, “A fast high utility itemsets mining algorithm,†in Proc. of the UtilityBasedData Mining Workshop, 2005.
A. Erwin, R.P. Gopalan, and N.R. Achuthan, “Efficient Mining of High Utility Itemsets from Large Data Sets,†Proc. 12th Pacific-Asia Conf. Advances in Knowledge Discovery and Data Mining (PAKDD), pp. 554-561, 2008.
E. Georgii, L. Richter, U. Ru¨ ckert, and S. Kramer, “Analyzing Microarray Data Using Quantitative Association Rules,†Bioinformatics,vol. 21, pp. 123-129, 2005.
J. Han, G. Dong, and Y. Yin, “Efficient Mining of Partial Periodic Patterns in Time Series Database,†Proc. Int’l Conf. on Data Eng.,pp. 106-115, 1999.
J. Han and Y. Fu, “Discovery of Multiple-Level Association Rules from Large Databases,†Proc. 21th Int’l Conf. Very Large Data Bases, pp. 420-431, Sept. 1995.
J. Han, J. Pei, and Y. Yin, “Mining Frequent Patterns without Candidate Generation,†Proc. ACM-SIGMOD Int’l Conf. Management of Data, pp. 1-12, 2000.
S.C. Lee, J. Paik, J. Ok, I. Song, and U.M. Kim, “Efficient Mining of User Behaviors by Temporal Mobile Access Patterns,†Int’l J. Computer Science Security, vol. 7, no. 2, pp. 285-291, 2007.
H.F. Li, H.Y. Huang, Y.C. Chen, Y.J. Liu, and S.Y. Lee, “Fast andMemory Efficient Mining of High Utility Itemsets in Data Streams,†Proc. IEEE Eighth Int’l Conf. on Data Mining, pp. 881-886, 2008.
Y.-C. Li, J.-S. Yeh, and C.-C. Chang, “Isolated Items Discarding Strategy for Discovering High Utility Itemsets,†Data and Knowledge Eng., vol. 64, no. 1, pp. 198-217, Jan. 2008.
Y.-C. Li, J.-S. Yeh, and C.-C. Chang, “Isolated Items Discarding Strategy for Discovering High Utility Itemsets,†Data and Knowledge Eng., vol. 64, no. 1, pp. 198-217, Jan. 2008.
C.H. Lin, D.Y. Chiu, Y.H. Wu, and A.L.P. Chen, “Mining Frequent Itemsets from Data Streams with a TimeSensitive Sliding Window,†Proc. SIAM Int’l Conf. Data Mining (SDM ’05), 2005.
Y. Liu, W. Liao, and A. Choudhary, “A Fast High Utility Itemsets Mining Algorithm,†Proc. Utility-Based Data Mining Workshop,2005.
R. Martinez, N. Pasquier, and C. Pasquier, “GenMiner: Mining nonredundant Association Rules from Integrated Gene Expression Data and Annotations,†Bioinformatics,vol. 24, pp. 2643-2644,2008.
J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, and D. Yang, “HMine:Fast and Space-Preserving Frequent Pattern Mining in Large Databases,†IIE Trans. Inst. of IndustrialEngineers, vol. 39, no. 6, pp. 593-605, June 2007.
J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Moal, and M.C. Hsu, “Mining Sequential Patterns by Pattern-Growth: The Prefixspan Approach,†IEEE Trans.Knowledge and Data Eng.,vol.16, no.10, pp. 14241440,Oct. 2004.