Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
#2. ECLAT algorithm Equivalence Class Clustering and bottom up Lattice Traversal Vidya Mahesh Huddar
Play lesson

Clustering in Data Mining and Machine Learning - #2. ECLAT algorithm Equivalence Class Clustering and bottom up Lattice Traversal Vidya Mahesh Huddar

4.0 (1)
14 learners

What you'll learn

This course includes

  • 5.5 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Keywords

Full Transcript

#2. ECLAT algorithm Equivalence Class Clustering and bottom up Lattice Traversal by Vidya Mahesh Huddar 1. ECLAT SOlved Example: https://youtu.be/P5LH5HCrhMU 2. ECLAT SOlved Example: https://youtu.be/bhGNOG7k_H4 The ECLAT algorithm stands for Equivalence Class Clustering and bottom-up Lattice Traversal. It is one of the popular methods of Association Rule mining. While the Apriori algorithm works in a horizontal sense imitating the Breadth-First Search of a graph, the ECLAT algorithm works in a vertical manner just like the Depth-First Search of a graph. This vertical approach of the ECLAT algorithm makes it a faster algorithm than the Apriori algorithm. ******************************** Follow Us on: 1. Blog / Website: https://www.vtupulse.com/ 2. Download Final Year Project Source Code: https://vtupulse.com/download-final-year-projects/ 3. Like Facebook Page: https://www.facebook.com/VTUPulse 4. Follow us on Instagram: https://www.instagram.com/vtupulse/ 5. Like, Share, Subscribe, and Don't forget to press the bell ICON for regular updates

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere