An implementation of the ID3 Decision Tree algorithm in Java from scratch.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 

44 lines
766 B

package com.AI;
import java.util.HashSet;
import java.util.Set;
class Attribute
{
private String attributeName;
private int attributeIndex;
private Set<String> valuesSet;
void addToValuesSet(String value)
{
valuesSet.add(value);
}
public Attribute()
{
valuesSet = new HashSet<>();
}
public Set<String> getValuesSet() {
return valuesSet;
}
public void setValuesSet(Set<String> valuesSet) {
this.valuesSet = valuesSet;
}
public String getAttributeName() {
return attributeName;
}
public void setAttributeName(String attributeName) {
this.attributeName = attributeName;
}
public int getAttributeIndex() {
return attributeIndex;
}
public void setAttributeIndex(int attributeIndex) {
this.attributeIndex = attributeIndex;
}
}