OSSM: Ordered Sequence set mining for maximal length frequent sequences

α
Anurag Choubey
Anurag Choubey
σ
Dr. Ravindra Patel
Dr. Ravindra Patel
ρ
Dr. J.L. Rana
Dr. J.L. Rana
α Rajiv Gandhi Technical University Rajiv Gandhi Technical University

Send Message

To: Author

OSSM: Ordered Sequence set mining for maximal length frequent sequences

Article Fingerprint

ReserarchID

V4URW

OSSM: Ordered Sequence set mining for maximal length frequent sequences Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

References

17 Cites in Article
  1. R Agrawal,R Srikant (1996). Mining Sequential Patterns: Generalizations and Performance Improvements Proceedings of the 5th International Conference on Extending Database Technology.
  2. Pei Han,J (2001). PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth.
  3. Mohammed Zaki (2001). SPADE: An Efficient Algorithm for Mining Frequent Sequences.
  4. M Garofalakis,R Rastogi,K Shim (2002). Mining sequential patterns with regular expression constraints.
  5. C Antunes,A Oliveira (2003). Generalization of Pattern-Growth Methods for Sequential Pattern Mining with Gap Constraints.
  6. D Lin,Z Kedem (1998). Pincer Search: A new algorithm for discovering the maximum frequent set.
  7. Anurag Choubey,Dr Patel,Dr Rana (2011). Concurrent Edge Prevision and Rear Edge Pruning Approach for Frequent Closed Itemset Mining.
  8. Jianyong Wang,Jiawei Han (null). BIDE: efficient mining of frequent closed sequences.
  9. Robert Floyd (1962). Algorithm 97: Shortest path.
  10. S Warshall (1962). A theorem on boolean matrices.
  11. M Zaki (2001). SPADE: An Efficient Algorithm for Mining Frequent Sequences.
  12. N Pasquier,Y Bastide,R Taouil,L (1999). Discoving frequent closed itemsets for association rules.
  13. Mohammed Zaki,Ching-Jui Hsiao (2002). CHARM: An Efficient Algorithm for Closed Itemset Mining.
  14. Ron Kohavi,Carla Brodley,Brian Frasca,Llew Mason,Zijian Zheng (2000). KDD-Cup 2000 organizers' report.
  15. J Han,J Wang,Y Lu,P Tzvetkov (2002). Mining Top-K Frequent Closed Patterns without Minimum Support.
  16. P Aloy,E Querol,F Aviles,M Sternberg (2002). Automated Structure-based Prediction of Functional Sites in Proteins: Applications to Assessing the Validity of Inheriting Protein Function From Homology in Genome Annotation and to Protein Docking.
  17. Jian Pei,Jiawei Han,Wei Wang (2002). Mining sequential patterns with constraints in large databases.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Anurag Choubey. 1970. \u201cOSSM: Ordered Sequence set mining for maximal length frequent sequences\u201d. Unknown Journal GJCST Volume 12 (GJCST Volume 12 Issue 7): .

Download Citation

Journal Specifications
Keywords
Version of record

v1.2

Issue date

April 4, 2012

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 20872
Total Downloads: 11116
2026 Trends
Related Research

Published Article

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

OSSM: Ordered Sequence set mining for maximal length frequent sequences

Anurag Choubey
Anurag Choubey Rajiv Gandhi Technical University
Dr. Ravindra Patel
Dr. Ravindra Patel
Dr. J.L. Rana
Dr. J.L. Rana

Research Journals