jgs Algorithms § K-Means - distance between points. Minimize square-error criterion. § DBSCAN (Density-Based Spatial Clustering of Applications with Noise) - distance between nearest points. § Simple EM (Expectation Maximization) is finding likelihood of an observation belonging to a cluster(probability). Maximize log- likelihood criterion
jgs Assignment | Part 1 § https://storm.cis.fordham.edu/~gweiss/data-mining/weka-data/iris.arff § The data was used to learn the description of an acceptable and unacceptable contract. § Number of Instances: 150 § @attribute 'class' {Iris-setosa,Iris-versicolor,Iris-virginica} § K-means (3) § DBSCAN § EM § Evaluation: Likelihood Values § Confusion Matrix, Accuracy
jgs Notes § Do not forget to separate Training and Testing datasets § Use your programming skills to calculate Confusion Matrix and Accuracy § As usual submit a paper including: A) Source Code B) Results B) Explain your findings and Conclusions § Academic Integrity 👀
Ph.D. [email protected] Spring 2022 Copyright. These slides can only be used as study material for the class CSE205 at Arizona State University. They cannot be distributed or used for another purpose.