skip to main content
10.1145/3279996.3280025acmotherconferencesArticle/Chapter ViewAbstractPublication PagesdatasConference Proceedingsconference-collections
research-article

Ultimate: unearthing latent time profiled temporal associations

Published: 01 October 2018 Publication History

Editorial Notes

NOTICE OF CONCERN: ACM has received evidence that casts doubt on the integrity of the peer review process for the DATA 2018 Conference. As a result, ACM is issuing a Notice of Concern for all papers published and strongly suggests that the papers from this Conference not be cited in the literature until ACM's investigation has concluded and final decisions have been made regarding the integrity of the peer review process for this Conference.

Abstract

Discovery of temporal association patterns from temporal databases is extensively studied by academic research community and applied in various industrial applications. Temporal association pattern discovery is extended to similarity based temporal association pattern discovery from time-stamped transaction databases by Sashi Sekhar, Yoo using methods to estimate support limits and distance limits of temporal item sets. Yoo also introduced methods for pruning using distance bounds and proposed SEQUENTIAL, SPAMINE approaches. Our previous research introduced algorithms G-SPAMINE, MASTER, Z-SPAMINE for time profiled association pattern discovery that applied distance measures SRIHASS, ASTRA, GARUDA, and KRISHNA SUDARSANA for similarity computations. SEQUENTIAL, SPAMINE, G-SPAMINE, MASTER, Z-SPAMINE approaches are all based on snapshot and lattice database scan strategies that prune itemsets making use of estimated support and distance values. The major limitation of all these algorithms is their inevitability to eliminate database scanning process for knowing true supports of itemsets. To eliminate the requirement of retaining database in main memory in order to know true supports, VRKSHA and GANDIVA are two pioneering research that introduced tree structure for time profiled association mining. VRKSHA is based on snapshot tree scan technique while GANDIVA is lattice tree scan based approach. VRKSHA and GANDIVA both apply Euclidean distance function but does not estimate support and distance bounds. This research introduced the pioneering work ULTIMATE that uses a novel tree structure generated using similarity measure ASTRA and applies support and distance bound computations for pruning temporal patterns. Experiment results showed that ULTIMATE outperforms SEQUENTIAL, SPAMINE, G-SPAMINE, MASTER, VRKSHA, GANDIVA algorithms.

References

[1]
Vangipuram Radhakrishna, P. V. Kumar, and V. Janaki. 2015. A Survey on Temporal Databases and Data mining. In Proceedings of the International Conference on Engineering & MIS 2015 (ICEMIS '15).
[2]
Vangipuram Radhakrishna, P. V. Kumar, and V. Janaki. 2015. A Novel Approach for Mining Similarity Profiled Temporal Association Patterns Using Venn Diagrams. In Proceedings of the International Conference on Engineering & MIS 2015 (ICEMIS '15). ACM, New York, NY, USA, Article 58, 9 pages.
[3]
Vangipuram Radhakrishna, P. V. Kumar, and V. Janaki. 2015. An Approach for Mining Similarity Profiled Temporal Association Patterns Using Gaussian Based Dissimilarity Measure. In Proceedings of the International Conference on Engineering & MIS 2015 (ICEMIS '15).
[4]
Vangipuram Radhakrishna, P. V. Kumar, and V. Janaki. 2016. Mining Outlier Temporal Association Patterns. In Proceedings of the Second International Conference on Information and Communication Technology for Competitive Strategies (ICTCS '16).
[5]
Jin Soung Yoo. Temporal Data Mining: Similarity profiled association pattern. Data Mining Found & Intel paradigms. Pg29--47
[6]
Jin Soung Yoo, Shashi Shekhar, Mining Temporal Association Patterns under a Similarity Constraint, Proceedings of the 20th international conference on Scientific and Statistical Database Management, July 09--11, 2008, Hong Kong, China.
[7]
Jin Soung Yoo, Shashi Shekhar, Similarity-Profiled Temporal Association Mining, IEEE Transactions on Knowledge and Data Engineering, v.21 n.8, p.1147--1161, August2009.
[8]
Shadi A. Aljawarneh, Radhakrishna Vangipuram, Veereswara Kumar Puligadda, and Janaki Vinjamuri. 2017. G-SPAMINE. Future Gener. Comput. Syst. 74, C (September 2017), 430--443.
[9]
Radhakrishna, V., Aljawarneh, S.A., Kumar, P.V. et al. Soft Comput (2018) 22:" 1903.
[10]
Nong Ye. 2013. Data Mining: Theories, Algorithms, and Examples (1st ed.). CRC Press, Inc., Boca Raton, FL, USA.
[11]
Vangipuram Radhakrishna, Shadi A. Aljawarneh, P.V. Kumar, V. Janaki, A novel fuzzy similarity measure and prevalence estimation approach for similarity profiled temporal association pattern mining, Future Generation Computer Systems, 2017, ISSN 0167-739X
[12]
Radhakrishna, V., Aljawarneh, S.A., Veereswara Kumar, P. ASTRA - A Novel interest measure for unearthing latent temporal associations and trends through extending basic Gaussian membership function, Multimed Tools Appl (2017).
[13]
Jiawei Han, Jian Pei, Yiwen Yin, and Runying Mao. 2004. Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. Data Min. Knowl. Discov. 8, 1 (January2004), 53--87.
[14]
Radhakrishna, V., Veereswara Kumar, P. & Janaki, V. SRIHASS - a similarity measure for discovery of hidden time profiled temporal associations. Multimed Tools Appl (2017).
[15]
Aljawarneh, S.A. & Vangipuram, R. GARUDA: Gaussian dissimilarity measure for feature representation and anomaly detection in Internet of things. J Supercomput (2018).
[16]
Radhakrishna V., Kumar P.V., Janaki V. (2017) A Computationally Efficient Approach for Mining Similar Temporal Patterns. In: Matoušek R. (eds) Recent Advances in Soft Computing. ICSC-MENDEL 2016. Advances in Intelligent Systems and Computing, vol 576. Springer, Cham
[17]
Radhakrishna V., Kumar P.V., Janaki V., Rajasekhar N. (2017) Estimating Prevalence Bounds of Temporal Association Patterns to Discover Temporally Similar Patterns. In: Matoušek R. (eds) Recent Advances in Soft Computing. ICSC-MENDEL 2016. Advances in Intelligent Systems and Computing, vol 576. Springer, Cham
[18]
Radhakrishna V., Kumar P.V., 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
[19]
Radhakrishna V, Kumar PV, Janaki V (2017) 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.
[20]
Radhakrishna V, Kumar PV, Janaki V, Cheruvu A (2017) A dissimilarity measure for mining similar temporal association patterns. IADIS International Journal on Computer Science and Information Systems 12(1):126--142.
[21]
Radhakrishna V, Kumar PV, Janaki V (2017) Normal distribution based similarity profiled temporal association pattern mining (N-SPAMINE). Database Systems Journal 7(3):22--33
[22]
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.
[23]
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.
[24]
Radhakrishna V, Kumar PV, Janaki V (2016) Mining of outlier temporal patterns. 2016 International Conference on Engineering & MIS (ICEMIS), Agadir, pp 1 -- 6.
[25]
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.
[26]
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, pp1--6.
[27]
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.
[28]
V. Radhakrishna, P. V. Kumar, S. A. Aljawarneh and V. Janaki, "Design and analysis of a novel temporal dissimilarity measure using Gaussian membership function," 2017 International Conference on Engineering & MIS (ICEMIS), Monastir, 2017, pp. 1--5.
[29]
V. Radhakrishna, S. A. Aljawarneh, V. Janaki and P. V. Kumar, "Looking into the possibility for designing normal distribution based dissimilarity measure to discover time profiled association patterns," 2017 International Conference on Engineering & MIS (ICEMIS), Monastir, 2017, pp. 1--5.
[30]
V. Radhakrishna, P. V. Kumar and V. Janaki, "A novel approach to discover similar temporal association patterns in a single database scan," 2015 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), Madurai, 2015, pp. 1--8.
[31]
A. Cheruvu, V. Radhakrishna and N. Rajasekhar, "Using normal distribution to retrieve temporal associations by Euclidean distance," 2017 International Conference on Engineering & MIS (ICEMIS), Monastir, 2017, pp. 1--3.
[32]
S. A. Aljawarneh, V. Radhakrishna and A. Cheruvu, "Extending the Gaussian membership function for finding similarity between temporal patterns," 2017 International Conference on Engineering & MIS (ICEMIS), Monastir, 2017, pp.1--6.
[33]
Y. C. Chen, W. C. Peng and S. Y. Lee, "Mining temporal patterns in interval-based data," 2016 IEEE 32nd International Conference on Data Engineering (ICDE), Helsinki, 2016, pp. 1506--1507.
[34]
Y. C. Chen, W. C. Peng and S. Y. Lee, "Mining Temporal Patterns in Time Interval-Based Data," in IEEE Transactions on Knowledge and Data Engineering, vol. 27, no. 12, pp. 3318--3331, Dec.1, 2015
[35]
Gupta M., Gao J., Sun Y., Han J. (2012) Community Trend Outlier Detection Using Soft Temporal Pattern Mining. In: Flach P.A., De Bie T., Cristianini N. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2012. Lecture Notes in Computer Science, vol 7524. Springer, Berlin, Heidelberg.
[36]
Lin, W., Orgun, M. A., & Williams, G. J. (2002). An Overview of temporal data mining. In S. J. Simoff, G. J. Williams, & M. Hegland (Eds.), Proceedings, Australasian Data Mining Workshop, ADM02 (pp. 83--89). Sydney: University of Technology, Sydney.
[37]
Vangipuram Radhakrishna, P. V. Kumar, V. Janaki, and Shadi Aljawarneh. 2018. GANDIVA - Time Profiled Temporal Pattern Tree. In Proceedings of the Fourth International Conference on Engineering & MIS 2018 (ICEMIS '18). ACM, New York, NY, USA, Article 36, 6 pages.
[38]
Vangipuram Radhakrishna, Shadi Aljawarneh, and Aravind Cheruvu. 2018. Sequential Approach for Mining of Temporal Itemsets. In Proceedings of the Fourth International Conference on Engineering & MIS 2018 (ICEMIS '18). ACM, New York, NY, USA, Article 33, 6 pages.
[39]
Vangipuram Radhakrishna, P. V. Kumar, and V. Janaki. 2018. Krishna Sudarsana: A Z-Space Similarity Measure. In Proceedings of the Fourth International Conference on Engineering & MIS 2018 (ICEMIS '18). ACM, New York, NY, USA, Article 44, 4 pages.
[40]
Shadi Aljawarneh, V. Radhakrishna, and Aravind Cheruvu. 2018. VRKSHA: A Novel Multi-Tree Based Sequential Approach for Seasonal Pattern Mining. In Proceedings of the Fourth International Conference on Engineering & MIS 2018 (ICEMIS '18). ACM, New York, NY, USA, Article 37, 10 pages.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
DATA '18: Proceedings of the First International Conference on Data Science, E-learning and Information Systems
October 2018
274 pages
ISBN:9781450365369
DOI:10.1145/3279996
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 2018

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. complexity
  2. itemset
  3. similarity
  4. support
  5. tree

Qualifiers

  • Research-article

Conference

DATA '18

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2022)Fraudulent Transactions Prediction Using Deep Neural Network2022 International Conference on Engineering & MIS (ICEMIS)10.1109/ICEMIS56295.2022.9914349(1-7)Online publication date: 4-Jul-2022
  • (2022)mHealth: A Secure Health Monitoring System for Diabetes2022 International Conference on Engineering & MIS (ICEMIS)10.1109/ICEMIS56295.2022.9914169(1-4)Online publication date: 4-Jul-2022
  • (2022)Service Quality in eLearning2022 International Conference on Engineering & MIS (ICEMIS)10.1109/ICEMIS56295.2022.9914135(1-5)Online publication date: 4-Jul-2022
  • (2021)Design and Analysis of activation functions used in deep learning modelsThe 7th International Conference on Engineering & MIS 202110.1145/3492547.3492575(1-5)Online publication date: 11-Oct-2021
  • (2021)Jordanian Higher Basic Stage Students’ uses of the Social Networking Site (Facebook) as a Mediator Assistant in Their LearningThe 7th International Conference on Engineering & MIS 202110.1145/3492547.3492574(1-5)Online publication date: 11-Oct-2021
  • (2021)Enhancing the Quality of the Arabic Content for Nursing on InternetThe 7th International Conference on Engineering & MIS 202110.1145/3492547.3492573(1-4)Online publication date: 11-Oct-2021
  • (2021)Acceptance of Blended learning Approach for Arab and European UniversitiesThe 7th International Conference on Engineering & MIS 202110.1145/3492547.3492572(1-4)Online publication date: 11-Oct-2021
  • (2021)Reviews of using solar energy to cover the energy deficit after the recent war in Mosul cityInternational Conference on Data Science, E-learning and Information Systems 202110.1145/3460620.3460766(254-265)Online publication date: 5-Apr-2021
  • (2021)Design of Gaussian Similarity Measure for Network Anomaly DetectionInternational Conference on Data Science, E-learning and Information Systems 202110.1145/3460620.3460759(225-230)Online publication date: 5-Apr-2021
  • (2021)Fuzzy Feature Similarity Functions for Feature Clustering and Dimensionality ReductionInternational Conference on Data Science, E-learning and Information Systems 202110.1145/3460620.3460758(219-224)Online publication date: 5-Apr-2021
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media