TA in Progress#2; Upper Approximation code

Lompat ke Komentar

Kode yang dipasang disini kali ini adalah bagian untuk menentukan pasangan Upper Approximation dan kardinalitas nya. Sebenarnya tak jauh berbeda dengan yang sebelumnya, mungkin hanya algoritma untuk mendapatkan Upper Approximation saja yang berubah signifikan.

Oh ya … sebelum lanjut, sebenarnya tulisan ini lebih dapat dinikmati dengan segelas teh hangat dan sepiring pisang goreng, lebih afdhol lagi kalau bacanya pada saat hujan turun … Mak Nyuzzz ….. *yang dinikmati teh hangat dan pisang goreng nya bukan program java nya .. hehehe*Selamat menikmati …

import java.sql.ResultSet;
import java.util.ArrayList;
import java.util.Iterator;
import org.rs.util.DbUtil;

/**
 *
 * @author noval
 *
 * This class used as prototype to calculate upper approximation
 * this class used fix alpha for a1, that should be dynamic
 */

public class UpperApproximation {
 private final String Driver = "org.gjt.mm.mysql.Driver";
 private final String Url = "jdbc:mysql://localhost/noval";
 private final String User = "root";
 private final String Password = "";
 private DbUtil dbut;
 private static String a1="medium";
 private ArrayList upperBound;

	public UpperApproximation() {
 	// initiating database connection
 	dbut = new DbUtil();
 	dbut.SetDb(Driver, Url, User, Password);
 }

	public void getUpperApproximation(String attribute1, String Attribte2){
 	// main algorithm to get the upper approximation over the dataset
 	upperBound = new ArrayList();
 	ResultSet rsParent = dbut.setQuery("select distinct a2 from dataset1 where a1='"+a1+"'");
 	ResultSet rsSub;
 	String query = "select a1,a2 from dataset1 where";
 	String alpha [];
 	try {
 		rsParent.last();
 		alpha = new String [rsParent.getRow()];
 		rsParent.beforeFirst();
 		int i = 0;
 		while (rsParent.next()){
 			alpha [i] = rsParent.getString(1);
 			//System.out.println("i ke "+i+" = "+alpha [i]);
 			i++;
 		}
 		for (int j = 0; j < i; j++){
 			if (j == 0){
 				query += " a2='"+alpha[j]+"'";
 			}else{
 				query += " or a2='"+alpha[j]+"'";
 			}
 		}

			rsSub = dbut.setQuery(query);
 		while (rsSub.next()){
 			upperBound.add(rsSub.getString(1) +", "+ rsSub.getString(2));
 		}
 	} catch (Exception e) {
 		e.printStackTrace();
 	}
 	printCollection(upperBound);
 }

	public void printCollection (ArrayList arl){
 	// Method for printing the result of upper approximation a1 = medium subject to a2
 	System.out.println("pasangan upper approximation dari a1 = "+a1+" subject to a2 adalah :");
 	int i = 0;
 	Iterator it = arl.iterator();
 	if (!it.hasNext()){
 		System.out.println("tidak mempunyai upper approximation");
 	}else {
 		while (it.hasNext()){
 			System.out.println(i +". "+ arl.get(i));
 			it.next();
 			i++;
 		}
 	}
 }

	public int calcUpperAppr(ArrayList arl){
 	return arl.size();
 }

	public static void main (String [] args){
 	UpperApproximation ua = new UpperApproximation();

		// get the upper approximation for attribute a1 subject to a2
 	ua.getUpperApproximation("a1", "a2");
 	System.out.println("CARD lower approximation a1=" + a1 + "subject to a2 is : " + ua.calcUpperAppr(ua.upperBound));
 }
}

& Komentar

Filed under Tugas Akhir, java, kuliah

Tag: java, Rough Set, Tugas Akhir, Upper Approximation