Abstract

Multidimensional data points discover structural and chronological association inside the data streams. The PaDSkyline framework in a distributed environment utilized intra group optimization and multi filtering technique for skyline query processing. Skyline query processes within each group of distributed data sets, but dynamic filtering point selection was not performed with cost effective system. Similarity- Profiled temporal Association MINing mEthod (SPAMINE) used reference time sequences and threshold value to filter the information from real world data. Different similarity models for filtering temporal patterns were not very effective for performing the phase shift in time. To attain minimal phase shift based cost effective filtering on multidimensional data stream, Analytic Associate Rule Filtering (AARF) mechanism is proposed in this study. The main objective of AARF is to identify the relationship between attributes on multidimensional data and to filter out the independent attributes from the data streams. Initially, analytic association rule uses the weight computing factor to identify relationship and make inferences while testing multidimensional samples. Secondly, with the help of the analyzed relationship, the AARF mechanism uses the attribute independent criterion to discard negligible weight from association rule. Finally, to filter the analytic association rule with specified phase shift time, the ‘if-then’ strategy is used in AARF mechanism. AARF mechanism has an ability to make an analytic filtering with minimal phase shift time on multidimensional test dataset. The minimal phase shift time reduces the execution time factor and attains cost effective filtering system. Experiment is conducted using Japanese vowel multidimensional data set extracted from UCI repository for measuring the factors such as the average precision level, execution time, filtering query traffic efficiency and true positive rate.

Keywords:

Analytic associate rule filtering, attributes, if-then strategy, multi-dimensional data streams, phase shift time, weight computing factor,

References

1. Abhijith, K., H. Vagelis, P. Michalis and T. Sotiria, 2011. Effective navigation of query results based on concept hierarchies. IEEE Trans. Knowl. Data Eng., 23(4): 540-553.
   CrossRef    
2. Dominik, F., G. Thiemo and S. Bernhard and R. Swift, 2011. Mining comprehensible classification rules for time series analysis. IEEE Trans. Knowl. Data Eng., 23(5): 774-787.
   CrossRef    
3. Jae-Gil, L., L. Xiaolei and C. Hong, 2011. Mining discriminative patterns for classifying trajectories on road networks. IEEE Trans. Knowl. Data Eng., 23(5): 713-726.
   CrossRef    
4. Jianxin, L., L. Chengfei, Z. Rui and X.Y. Jeffrey, 2013. Quasi-SLCA based keyword query processing over probabilistic XML data. IEEE Trans. Knowl. Data Eng., 26(4): 957-969.
   CrossRef    
5. Jie, Z., W. Yuping and F. Junhong, 2013. Attribute index and uniform design based multiobjective association rule mining with evolutionary algorithm. Hindawi Publishing Corporation, Scient. World J., Article ID 259347.
   
6. Jin, S.Y. and S. Shashi, 2009. Similarity-profiled temporal association mining. IEEE Trans. Knowl. Data Eng., 21(8): 1147-1161.
   CrossRef    
7. Lei, Z. and C. Lei, 2011. Pareto-based dominant graph: An efficient indexing structure to answer top-K queries. IEEE Trans. Knowl. Data Eng., 23(5): 727-741.
   CrossRef    
8. Lijiang, C., C. Bin and L. Hua, 2011. Constrained skyline query processing against distributed data sites. IEEE Trans. Knowl. Data Eng., 23(2): 204-217.
   CrossRef    
9. Ozgur, C. and E.A. Murat, 2012. A recommendation engine by using association rules. Proceedings of the Social and Behavioral Sciences, Elsevier, pp: 452-456.
   
10. Shweta, T. and K.B. Kamal, 2012. Enhanced new user recommendations based on quantitative association rule mining. Proceedings of the Computer Science, Elsevier, October, pp: 102-109.
    
11. Tamir, T., 2014. Secure mining of association rules in horizontally distributed databases. IEEE Trans. Knowl. Data Eng., 26(4): 970-983.
    CrossRef    
12. Tarek, F.G., N. Hamed, T. Mohamed and A.T. Ajith, 2010. An efficient algorithm for incremental mining of temporal association rules. Data Knowl. Eng., Elsevier, 69(8): 800-815.
    
13. Victoria, N. and B. Rafael, 2011. Finding association rules in semantic web data. Proceedings of the Knowledge-Based Systems, Elsevier, May, pp: 51-62.
    
14. Vivek, B., R.S. Thakur and G.S. Thakur, 2014. A review on dealing uncertainty, imprecision and vagueness in association rule mining using extended and generalized fuzzy. Int. J. Eng. Comp. Sci., 03(07): 6963-6966.
    
15. Weifeng, S., W. Jiying and H.L. Frederick, 2010. Record matching over query results from multiple web databases. IEEE Trans. Knowl. Data Eng., 22(4): 578-589.
    CrossRef    
16. Wenjing, Z. and F. Xin, 2011. Event characterization and prediction based on temporal patterns in dynamic data system. IEEE Trans. Knowl. Data Eng., 26(1): 144-156.
    
17. Xu, H., M. Fan and Z. William, 2013. Parametric rough sets with application to granular association rule mining. Hindawi Publish. Corporat., Math. Problems Eng., 2013, Article ID: 461363.
    
18. Yang, O., J.L. Zheng, R.K. Hamid and T. Ying, 2014. Multilevel association rule mining for bridge resource management based on immune genetic algorithm. Hindawi Publish. Corporat. Abstract Appl. Anal. 2014, Article ID: 278694.
    
19. Ying, Z., Z. Wenjie, L. Qianlu and L. Xuemin, 2011. Effectively indexing the multi-dimensional uncertain objects for range searching. Proceedings of the 15th International Conference on Extending Database Technology, New York, pp: 504-515.
    PMid:21762406    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.