Skip to main content
SpringerLink
Log in

ASTRA - A Novel interest measure for unearthing latent temporal associations and trends through extending basic gaussian membership function

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Time profiled association mining is one of the important and challenging research problems that is relatively less addressed. Time profiled association mining has two main challenges that must be addressed. These include addressing i) dissimilarity measure that also holds monotonicity property and can efficiently prune itemset associations ii) approaches for estimating prevalence values of itemset associations over time. The pioneering research that addressed time profiled association mining is by J.S. Yoo using Euclidean distance. It is widely known fact that this distance measure suffers from high dimensionality. Given a time stamped transaction database, time profiled association mining refers to the discovery of underlying and hidden time profiled itemset associations whose true prevalence variations are similar as the user query sequence under subset constraints that include i) allowable dissimilarity value ii) a reference query time sequence iii) dissimilarity function that can find degree of similarity between a temporal itemset and reference. In this paper, we propose a novel dissimilarity measure whose design is a function of product based gaussian membership function through extending the similarity function proposed in our earlier research (G-Spamine). Our approach, MASTER (Mining of Similar Temporal Associations) which is primarily inspired from SPAMINE uses the dissimilarity measure proposed in this paper and support bound estimation approach proposed in our earlier research. Expression for computation of distance bounds of temporal patterns are designed considering the proposed measure and support estimation approach. Experiments are performed by considering naïve, sequential, Spamine and G-Spamine approaches under various test case considerations that study the scalability and computational performance of the proposed approach. Experimental results prove the scalability and efficiency of the proposed approach. The correctness and completeness of proposed approach is also proved analytically.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26

Similar content being viewed by others

References

  1. Agrawal R and Shafer JC (1996) Parallel Mining of Association Rules: Design, Implementation, and Experience. IEEE Trans. Knowledge and Data Eng, pp. 487–499

  2. Agrawal R, Srikant R (1994) Fast Algorithms for Mining Association Rules in Large Databases. In: Bocca JB, Jarke M, Zaniolo C (eds) Proceedings of the 20th International Conference on Very Large Data Bases (VLDB ’94). Morgan Kaufmann Publishers Inc., San Francisco, pp 487–499

  3. Agrawal R, Srikant R (1995) Mining Sequential Patterns. In: Proc. IEEE Int’l. Conference on Database Engineering, 3–14

  4. Agrawal R, Imieliński T, Swami A (1993) Mining association rules between sets of items in large databases. SIGMOD Rec 22(2):207–216. https://doi.org/10.1145/170036.170072

    Article  Google Scholar 

  5. Agrawal R, Imielinski T, Swami A (1994) Database mining: A performance perspective. IEEE TOKDE 5(5):914–925

    Google Scholar 

  6. Ale JM, Rossi GH (2000) An approach to discovering temporal association rules. In: Carroll J, Damiani E, Haddad H, Oppenheim D (eds) Proceedings of the 2000 ACM symposium on Applied computing - Volume 1 (SAC ’00), vol 1. ACM, New York, pp 294–300. https://doi.org/10.1145/335603.335770

  7. Aljawarneh S, Aldwairi M Muneer Bani Yassein, “Anomaly-based intrusion detection system through feature selection analysis and building hybrid efficient model”. J Comput Sci, ISSN 1877-7503. https://doi.org/10.1016/j.jocs.2017.03.006

  8. Aljawarneh S, Radhakrishna V, Kumar PV, Janaki V (2016) A similarity measure for temporal pattern discovery in time series data generated by IoT. 2016 International Conference on Engineering & MIS (ICEMIS), Agadir, pp 1–4

    Google Scholar 

  9. Aljawarneh SA, Elkobaisi MR, Maatuk AM (2016) A new agent approach for recognizing research trends in wearable systems. Comput Electr Eng. https://doi.org/10.1016/j.compeleceng.2016.12.003

  10. Aljawarneh SA, Moftah RA, Maatuk AM (2016) Investigations of automatic methods for detecting the polymorphic worms signatures. Futur Gener Comput Syst 60:67–77, ISSN 0167-739X. https://doi.org/10.1016/j.future.2016.01.020

    Article  Google Scholar 

  11. Aljawarneh SA, Radhakrishna V, Kumar PV, Janaki V (2017) G-SPAMINE: an approach to discover temporal association patterns and trends in internet of things. Futur Gener Comput Syst 74:430–443. https://doi.org/10.1016/j.future.2017.01.013

  12. Bettini C, Wang X, Jajodia S (1996) Testing complex temporal relationships involving multiple granularities and its application to data mining. Proceedings of the Fifteenth ACM SIGACTSIGMOD-SIGART Symposium on principles of database systems, series PODS ’96, Montreal, Quebec, Canada. ACM, New York. Proc. of the ACM PODS’96: 68–78. https://doi.org/10.1145/237661.237680

  13. Bettini C, Wang XS, Jajodia S (1998) Mining temporal relationships with multiple granularities in time sequences. Data Engineering Bulletin 21(1):32–38. http://131.107.65.22/pub/debull/98mar/98MAR-CD.pdf#page=34

  14. Bettini C, Wang XS, Jajodia S, Lin JL (1998) Discovering frequent event patterns with multiple granularities in time sequences. IEEE Trans Knowl Data Eng 10(2):222–237. https://doi.org/10.1109/69.683754

  15. Borgelt C (2005) Keeping things simple: finding frequent item sets by recursive elimination. In: Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations (OSDM '05). ACM, New York, 66–70. https://doi.org/10.1145/1133905.1133914

  16. Calders T, Paredaens J (2003) Axiomatization of frequent itemsets. Theor Comput Sci 290(1):669–693, ISSN 0304-3975. https://doi.org/10.1016/S0304-3975(02)00081-6

  17. Chanda AK, Ahmed CF, Samiullah Md., Leung CK (2017) A new framework for mining weighted periodic patterns in time series databases. Expert Systems with Applications (79) :207-224. https://doi.org/10.1016/j.eswa.2017.02.028

  18. Chen X, Petr I (2000) Discovering temporal association rules: algorithms, language, and system. In: Proc. 2000 Int’l Conf Data Eng

  19. Chen YC, Peng WC, Lee SY (2015) Mining Temporal Patterns in Time Interval-Based Data. IEEE Trans Knowl Data Eng 27(12):3318-3331. https://doi.org/10.1109/TKDE.2015.2454515

  20. Chen C-H, Lan G-C, Hong T-P, Lin S-B (2016) Mining fuzzy temporal association rules by item lifespans. Appl Soft Comput 41:265–274. https://doi.org/10.1016/j.asoc.2016.01.008

  21. Cheruvu A, Radhakrishna V (2016) Estimating temporal pattern bounds using negative support computations. 2016 International Conference on Engineering & MIS (ICEMIS), Agadir, pp 1–4. https://doi.org/10.1109/ICEMIS.2016.7745352

    Book  Google Scholar 

  22. Cheung D, Han J, Ng V, Wong CY (1996) Maintenance of discovered association rules in large databases: an incremental updating technique. In: Proc. 1996 Int’l Conf. Data Eng., pp. 106–114

  23. Cohen E et al (2001) Finding Interesting Associations without Support Pruning. IEEE Trans Knowl Data Eng 13(1):64–78

    Article  Google Scholar 

  24. Dong G, Li J (1999) Efficient mining of emerging patterns: discovering trends and differences. In Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD ’99). ACM, New York, NY, USA, 43-52. https://doi.org/10.1145/312129.312191

  25. Gharib TF, Nassar H, Taha M, Abraham A (2010) An efficient algorithm for incremental mining of temporal association rules. Data Knowl Eng 69(8):800–815

  26. Grahne G, Zhu J (2005) Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans Knowl Data Eng 17(10):1347–1362. https://doi.org/10.1109/TKDE.2005.166

    Article  Google Scholar 

  27. Guil F, Marín R (2012) A tree structure for event-based sequence mining. Knowl-Based Syst 35:186–200. https://doi.org/10.1016/j.knosys.2012.04.027

  28. Guil F, Bailón A, Álvarez JA, Marín R (2013) Mining generalized temporal patterns based on fuzzy counting. Expert Syst Appl 40(4):1296–1304, ISSN 0957-4174. https://doi.org/10.1016/j.eswa.2012.08.061

  29. Gunupudi RK, Nimmala M, Gugulothu N, Gali SR (2017, ISSN 0167-739X) CLAPP: A self constructing feature clustering approach for anomaly detection. Futur Gener Comput Syst. https://doi.org/10.1016/j.future.2016.12.040

  30. Han J, Yongjian F (1995) Discovery of Multiple-Level Association Rules from Large Databases. In: Dayal U, Gray PMD, Nishio S (eds) Proceedings of the 21th International Conference on Very Large Data Bases (VLDB '95). Morgan Kaufmann Publishers Inc., San Francisco, pp 420–431

    Google Scholar 

  31. Han J, Dong G, Yin Y (1999) Efficient mining of partial periodic patterns in time series database. Proc. 15th Int’l Conf. Data Eng., pp. 106–115

  32. Han J, Pei J, Yin Y, Mao R (2004) Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. Data Min Knowl Disc 8:53–87

    Article  MathSciNet  Google Scholar 

  33. Imran A, Aljawarneh SA, Sakib K Web Data Amalgamation for Security Engineering: Digital Forensic Investigation of Open Source Cloud. J Univer Comput Sci 22(4):494–520

  34. Jiang JY, Liou RJ, Lee SJ (2011) A Fuzzy Self-Constructing Feature Clustering Algorithm for Text Classification. IEEE Trans Knowl Data Eng 23(3):335–349. https://doi.org/10.1109/TKDE.2010.122

    Article  Google Scholar 

  35. Kumar GR, Mangathayaru N, Narasimha G (2015) An improved k-means clustering algorithm for intrusion detection using gaussian function. In: Proceedings of the The International Conference on Engineering & MIS 2015 (ICEMIS ’15). https://doi.org/10.1145/2832987.2833082

  36. Kumar GR, Mangathayaru N, Narsimha G (2016) Design of novel fuzzy distribution function for dimensionality reduction and intrusion detection. 2016 International Conference on Engineering & MIS (ICEMIS), Agadir, pp 1–6

  37. Kumar GR, Mangathayaru N, Narsimha G An Approach for Intrusion Detection Using Novel Gaussian Based Kernel Function. J Univers Comput Sci 22(4):589–604

  38. Last M, Klein Y, Kandel A (2001) Knowledge discovery in time series databases. IEEE Trans Syst, Man, Cybern, B (Cybern) 31(1):160–169. https://doi.org/10.1109/3477.907576

    Article  Google Scholar 

  39. Lee W-J, Lee S-J (2004) Discovery of fuzzy temporal association rules. IEEE Trans Syst Man Cybern B (Cyber) 34(6):2330–2342. https://doi.org/10.1109/TSMCB.2004.835352

    Article  Google Scholar 

  40. Lee CH, Lin CR, Chen MS (2001) Sliding-window filtering: an efficient algorithm for incremental mining. In: Proceedings of the Tenth International Conference on Information and Knowledge Management. ACM, New York, pp 263-270. https://doi.org/10.1145/502585.502630

  41. Lee C-H, Chen M-S, Lin C-R (2003) Progressive partition miner: an efficient algorithm for mining general temporal association rules. IEEE Trans Knowl Data Eng 15(4):1004–1017. https://doi.org/10.1109/TKDE.2003.1209015

    Article  Google Scholar 

  42. Lee WJ, Jiang JY, Lee SJ (2004) An efficient algorithm to discover calendar-based temporal association rules. 2004 I.E. International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583) 4:3122–3127. https://doi.org/10.1109/ICSMC.2004.1400819

  43. Lee YJ, Lee JW, Chai DJ, Hwang BH, Ryu KH (2009) Mining temporal interval relational rules from temporal data. J Syst Softw 82(1):155–167. https://doi.org/10.1016/j.jss.2008.07.037

    Article  Google Scholar 

  44. Li Y, Ning P, Wang XS, Jajodia S (2001) Discovering Calendar Based Temporal Association Rules. Proceedings Eighth International Symposium on Temporal Representation and Reasoning. pp 111–118. https://doi.org/10.1109/TIME.2001.930706

  45. Li Y, Ning P, Wang XS, Jajodia S (2001) Discovering calendar-based temporal association rules. Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001, Cividale del Friuli, pp. 111–118. https://doi.org/10.1109/TIME.2001.930706

  46. Li Y, Ning P, Sean Wang X, Jajodia S (2003) Discovering calendar-based temporal association rules. Data Knowl Eng 44(2):193–218, ISSN 0169-023X. https://doi.org/10.1016/S0169-023X(02)00135-0

    Article  Google Scholar 

  47. Lin MY, Lee SY (2002) Fast Discovery of Sequential Patterns by Memory Indexing. In: Kambayashi Y, Winiwarter W, Arikawa M (eds) Data Warehousing and Knowledge Discovery. DaWaK 2002. Lecture Notes in Computer Science, vol 2454. Springer, Berlin, Knowledge Discovery. DaWaK 2002. Lecture Notesin Computer Science, vol 2454. Springer, Berlin, https://doi.org/10.1007/3-540-46145-0_15

  48. Lin M-Y, Hsueh S-C, Chang C-W (2008) Fast discovery of sequential patterns in large databases using effective time-indexing. Inf Sci 178(22):4228–4245. https://doi.org/10.1016/j.ins.2008.07.012

  49. Lin YS, Jiang JY, Lee SJ (2014) A Similarity Measure for Text Classification and Clustering. IEEE Trans Knowl Data Eng 26(7):1575–1590. https://doi.org/10.1109/TKDE.2013.19 http://ieeexplore.ieee.org/document/6420834/

    Article  Google Scholar 

  50. Lind DA, Marchal WG, Wathen SA (2004) Statistical techniques in business and economics, 12e: Chapter 7: Continuous Probability Distributions. The McGraw-Hill Companies, New York

  51. Liu B, Hsu W, Ma Y (1999) Mining association rules with multiple minimum supports. In: Proc. Int’l Conf. Knowledge Discovery and Data Mining

  52. Mannila H, Toivonen H, Verkamo I (1995) Discovering Frequent Episodes in Sequences. KDD’95. AAAI, Menlo Park, pp 210–215

    Google Scholar 

  53. Ozden B, Ramaswamy S, Silberschatz A (1998) Cyclic association rules. In: Proceedings of the Fourteenth International Conference on Data Engineering (ICDE). IEEE Computer Society, Washington, DC, pp 412–421. http://dl.acm.org/citation.cfm?id=645483.656222. Accessed 10 Nov 2017

  54. Park JS, Chen MS, Yu PS (1997) Mining association rules with adjustable accuracy. In: Proc. ACM Sixth Int’l Conf. Information and Knowledge Management, pp. 151–160

  55. Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering Frequent Closed Itemsets for Association Rules. In: Beeri C, Buneman P (eds) Proceedings of the 7th International Conference on Database Theory (ICDT ’99). Springer-Verlag, London, 19:398–416. http://dl.acm.org/citation.cfm?id=645503.656256. Accessed 10 Nov 2017

  56. Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M (2001) PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth. In: Proceedings of the 17th International Conference on Data Engineering. IEEE Computer Society, Washington, DC, pp 215–224

    Google Scholar 

  57. Radhakrishna V, Kumar PV, Janaki V (2015) A survey on temporal databases and data mining. In: Proceedings of the The International Conference on Engineering & MIS 2015 (ICEMIS ’15). ACM, New York, Article 52, 6 pages. https://doi.org/10.1145/2832987.2833064

  58. Radhakrishna V, Kumar PV, Janaki V (2015) A Novel Approach for Mining Similarity Profiled Temporal Association Patterns Using Venn Diagrams. In : Proceedings of the The International Conference on Engineering & MIS 2015 (ICEMIS ’15). ACM, New York, NY, USA, Article 58, 9 pages. http://dx.doi.org/10.1145/2832987.2833071

  59. Radhakrishna V, Kumar PV, Janaki V (2016) A computationally optimal approach for extracting similar temporal patterns. 2016 International Conference on Engineering & MIS (ICEMIS), Agadir, pp 1–6. https://doi.org/10.1109/ICEMIS.2016.7745344

  60. Radhakrishna V, Kumar PV, Janaki V (2016) An Approach for Mining Similar Temporal Association Patterns in Single Database Scan. In: Satapathy S, Das S (eds) Proceedings of First International Conference on Information and Communication Technology for Intelligent Systems: Volume 2. Smart Innovation, Systems and Technologies, vol 51. Springer, Cham. https://doi.org/10.1007/978-3-319-30927-9_60

  61. Radhakrishna V, Kumar PV, Janaki V (2016) Mining of outlier temporal patterns. 2016 International Conference on Engineering & MIS (ICEMIS), Agadir, pp 1–6. https://doi.org/10.1109/ICEMIS.2016.7745343

    Book  Google Scholar 

  62. Radhakrishna V, Kumar PV, Janaki V, Aljawarneh S (2016) A similarity measure for outlier detection in timestamped temporal databases. 2016 International Conference on Engineering & MIS (ICEMIS), Agadir, pp 1–5. https://doi.org/10.1109/ICEMIS.2016.7745347

    Book  Google Scholar 

  63. Radhakrishna V, Kumar PV, Janaki V (2016) Looking into the possibility of novel dissimilarity measure to discover similarity profiled temporal association patterns in IoT. 2016 International Conference on Engineering & MIS (ICEMIS), Agadir, pp 1–5

    Google Scholar 

  64. Radhakrishna V, Kumar PV, Janaki V, Aljawarneh S (2016) A computationally efficient approach for temporal pattern mining in IoT. 2016 International Conference on Engineering & MIS (ICEMIS), Agadir, pp 1–4. https://doi.org/10.1109/ICEMIS.2016.7745354

    Book  Google Scholar 

  65. Radhakrishna V, Aljawarneh SA, Kumar PV, Choo K-KR (2016) A novel fuzzy gaussian-based dissimilarity measure for discovering similarity temporal association patterns. Soft Comput. https://doi.org/10.1007/s00500-016-2445-y

  66. Radhakrishna V, Kumar PV, Janaki V (2016) A computationally efficient approach for mining similar temporal patterns. In: Proceedings of the 22nd International Conference on Soft Computing (MENDEL 2016) held in Brno, Czech Republic, Vol 576, Advances in Intelligent Systems and Computing. https://link.springer.com/chapter/10.1007/978-3-319-58088-3_19

  67. Radhakrishna V, Kumar PV, Janaki V (2016) Estimating prevalence bounds of patterns to discover similar temporal association patterns. In: Proceedings of the 22nd International Conference on Soft Computing (MENDEL 2016) held in Brno, Czech Republic, Vol 576, Advances in Intelligent Systems and Computing. https://link.springer.com/chapter/10.1007/978-3-319-58088-3_20

  68. Radhakrishna V, Aljawarneh SA, Kumar PV, Janaki V (2017) A novel fuzzy similarity measure and prevalence estimation approach for similarity profiled temporal association pattern mining. Futur Gener Comput Syst. https://doi.org/10.1016/j.future.2017.03.016 ISSN 0167-739X

  69. Radhakrishna V, Kumar PurluV, Janaki V (2017) Multimed Tools Appl. 10.1007/s11042-017-5185-9

  70. Radhakrishna V, Kumar PV, Janaki V A Novel Similar Temporal System Call Pattern Mining for Efficient Intrusion Detection. J Univers Comput Sci 22(4):475–493

  71. Ramaswamy S, Mahajan S, Silberschatz A (1998) On the discovery of interesting patterns in association rules. In: Proc. Int’l Conf. Very Large Databases (VLDB). Morgan Kaufmann Publishers Inc., San Francisco, 12:368–379. http://dl.acm.org/citation.cfm?id=645924.671170. Accessed 10 Nov 2017

  72. Sohrabi MK, Barforoush AA (2012) Efficient colossal pattern mining in high dimensional datasets. Knowl-Based Syst 33:41–52. https://doi.org/10.1016/j.knosys.2012.03.003

    Article  Google Scholar 

  73. Srikant R, Agrawal R (1995) Mining Generalized Association Rules. In: Dayal U, Gray PMD, Nishio S (eds) Proceedings of the 21th International Conference on Very Large Data Bases (VLDB '95). Morgan Kaufmann Publishers Inc., San Francisco, pp 407–419

    Google Scholar 

  74. Srikant R, Agrawal R (1996) Mining quantitative association rules in large relational tables. In: Widom J (ed) Proceedings of the 1996 ACM SIGMOD international conference on Management of data (SIGMOD ’96). ACM, New York, 25(12):1–12. https://doi.org/10.1145/233269.233311

  75. Srikant R, Agrawal R (1996) Mining sequential patterns: Generalizations and performance improvements. In: Apers P, Bouzeghoub M, Gardarin G (eds) Advances in Database Technology — EDBT '96. EDBT 1996. Lecture Notes in Computer Science, vol 1057. Springer, Berlin

  76. Tansel UA, Imberman SP (2007) Discovery of Association Rules in Temporal Databases. Information Technology, 2007. ITNG ’07. Fourth International Conference on, Las Vegas, NV, 2007, pp. 371-376. https://doi.org/10.1109/ITNG.2007.78

  77. Tung AKH, Han J, Lakshmanan LVS, Ng RT (2001) Constraint-based clustering in large databases. In: Proc. 2001 Int’l Conf. Database Theory

  78. Vangipuram R, Kumar PV, Janaki V Design and analysis of similarity measure for discovering similarity profiled temporal association patterns. IADIS International Journal on Computer Science and Information Systems 12(1):45–60

  79. Vangipuram R, Kumar PV, Janaki V, Cheruvu AA dissimilarity measure for mining similar temporal association patterns. IADIS International Journal on Computer Science and Information Systems 12 142(1):126

  80. Vangipuram R, Kumar PV, Janaki V Normal Distribution Based Similarity Profiled Temporal Association Pattern Mining (N-SPAMINE). Database Systems Journal 7(3):22–33

  81. Villafane R, Hua KA, Tran D, Maulik B (1999) Mining Interval Time Series. Data Warehousing and Knowledge Discovery:318–330. https://doi.org/10.1007/3-540-48298-9_34

  82. Winarko E, Roddick JF (2007) An algorithm for discovering richer relative temporal association rules from interval-based data. Data Knowl Eng 63(1):76–90, ISSN 0169-023X. https://doi.org/10.1016/j.datak.2006.10.009

    Article  Google Scholar 

  83. Yang C, Fayyad U, Bradley PS (2001) Efficient discovery of error-tolerant frequent itemsets in high dimensions. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '01). ACM, New York, 194–203. 10.1145/502512.502539

  84. Yoo JS (2012) Temporal data mining: similarity-profiled association pattern. Data mining: foundations and intelligent paradigms 23:29–47

  85. Yoo JS, Shekhar S (2008) Mining temporal association patterns under a similarity constraint. In: Proceedings of the 20th international conference on Scientific and Statistical Database Management. Springer-Verlag, Berlin, Heidelberg, 17:401–417 https://doi.org/10.1007/978-3-540-69497-7_26

  86. Yoo JS, Shekhar S (2009) Similarity-Profiled Temporal Association Mining. IEEE Trans Knowl Data Eng 21(8):1147–1161. https://doi.org/10.1109/TKDE.2008.185

    Article  Google Scholar 

  87. Yoo JS, Zhang P, Shekhar S (2005) Mining Time-Profiled Associations: An Extended Abstract. In: Ho TB, Cheung D, Liu H (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2005. Lecture Notes in Computer Science, vol 3518. Springer, Berlin

    Google Scholar 

  88. Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372–390. https://doi.org/10.1109/69.846291

    Article  Google Scholar 

  89. Zaki MJ, Gouda K (2003) Fast vertical mining using diffsets. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD ’03). ACM, New York, 10:326–335. https://doi.org/10.1145/956750.956788

  90. Zhu F, Yan X, Han J, Yu PS, Cheng H (2007) Mining Colossal Frequent Patterns by Core Pattern Fusion. IEEE 23rd International Conference on Data Engineering, Istanbul, pp 706–715. https://doi.org/10.1109/ICDE.2007.367916

    Book  Google Scholar 

  91. Zhuang DEH, Li GCL, Wong AKC (2014) Discovery of Temporal Associations in Multivariate Time Series. IEEE Trans Knowl Data Eng 26(12):2969–2982. https://doi.org/10.1109/TKDE.2014.2310219

    Article  Google Scholar 

Download references

Acknowledgements

Vangipuram Radhakrishna is heartfully thankful to his mentor and esteemed professor P.V. Kumar for his guidance and motivation throughout this research. We are also thankful to Aravind Cheruvu, graduated student from Department of Information Technology, VNR VJIET for his participation in this research work.

Author information

Authors and Affiliations

  1. Department of Information Technology, VNR Vignana Jyothi Institute of Engineering and Technology (Autonomous), Hyderabad, Telangana, 500090, India

    Vangipuram Radhakrishna

  2. Department of Software Engineering, Jordan University of Science and Technology, Irbid, Jordan

    Shadi A. Aljawarneh

  3. Department of Computer Science and Engineering, Acharya Institute of Technology, Bangalore, India

    Puligadda Veereswara Kumar

  4. University College of Engineering, Osmania University, Hyderabad, India

    Puligadda Veereswara Kumar

  5. Department of Computer Science and Engineering, Vaagdevi College of Engineering (Autonomous), Warangal, India

    Vinjamuri Janaki

Authors
  1. Vangipuram Radhakrishna
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shadi A. Aljawarneh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Puligadda Veereswara Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Vinjamuri Janaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vangipuram Radhakrishna.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Radhakrishna, V., Aljawarneh, S.A., Veereswara Kumar, P. et al. ASTRA - A Novel interest measure for unearthing latent temporal associations and trends through extending basic gaussian membership function. Multimed Tools Appl 78, 4217–4265 (2019). https://doi.org/10.1007/s11042-017-5280-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-017-5280-y

Keywords

Search

Navigation