OSSM: Ordered Sequence set mining for maximal length frequent sequences

§ Rajiv Gandhi Technological University, Bhopal, India Rajiv Gandhi Technological University, Bhopal, India

Send Message

To: Author

OSSM: Ordered Sequence set mining for maximal length frequent sequences

Article Fingerprint

ReserarchID

CSTV4URW

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

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • 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
Reading Preferences
Font Size
Line Spacing
Background

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, Dr. Ravindra Patel, Dr. J.L. Rana. 1970. "OSSM: Ordered Sequence set mining for maximal length frequent sequences". Global Journal of Computer Science and Technology GJCST Volume 12 (GJCST Volume 12 Issue 7).

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST Classification F.3.m
Version of record

v1.2

Issue date
April 4, 2012

Language
English
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: 5.3K
Total Downloads: 272
All Trends

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

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 Technological University, Bhopal, India
Dr. Patel
Dr. Patel
Dr. Rana
Dr. Rana