noteJ

noteJ

  • 분류 전체보기 (27)
    • Machine Learning (26)
    • Django (1)
  • 홈
  • 태그
  • 방명록
RSS 피드
로그인
로그아웃 글쓰기 관리

noteJ

컨텐츠 검색

태그

Automated Test Naïve Bayes classifier Apriori algorithm Nearest Neighbor Classifier variable transformation Curse of dimensionality Pre-processing data-mining zero count Dimensionality Reduction multiple classification feature creation LVQ association rules pre processing Numeric underflow discretization stratified sampling feature subset selection MLP calculation

최근글

댓글

공지사항

아카이브

k-means(1)

  • Difference between K-means and LVQ

    K-means and LVQ (Learning Vector Quantization) are both clustering algorithms used in machine learning, but they have some key differences. K-means is a popular unsupervised clustering algorithm that seeks to partition a set of data points into K clusters, where K is a pre-defined number chosen by the user. The algorithm works by first randomly initializing K cluster centers and then iteratively..

    2023.03.06
이전
1
다음
티스토리
© 2018 TISTORY. All rights reserved.

티스토리툴바