damina Namespace Reference

Data Mining Library namespace. More...

Classes
class	AbstractSVM
	An abstract class which implements the basics for the Support Vector Machines. More...
class	CCLSVClustering
	An implementation of the Support Vector Clustering originally proposed by Ben-Hur et al (2001), with a variation in the Cluster Labeling part. More...
class	ClassificationEngine
	A class which provides the basic interface for all classifiers. More...
class	ClusteringEngine
	A class which provides the basic interface for all clustering engines. More...
class	DataSet
	A class which is useful for manage both Training Sets and Test Sets. More...
class	EuclideanDistance
	The EuclideanDistance class is a base class to implement euclidean norms (L2, L1, . More...
class	Feature
	Encapsulates a Feature for feature vector representaion of data. More...
class	FileLoader
	Implements the file loader. More...
class	GKWGenerator
	An implementation of the Secant Algorithm fot Gaussian Kernel Widht generation. More...
class	KernelType
	Provides encoding for representing Kernel Types. More...
class	L1Distance
	L1 Distance implementation. More...
class	L2Distance
	L2 Distance implementation. More...
class	LearningEngine
	A class which provides the basic interface for all learning engines. More...
class	LibsvmFileLoader
	Implements a specific file loader for LibSVM structures. More...
class	LibsvmUtils
	Provides utilties for Libsvm as public static methods. More...
class	OneClassSVM
	An implementation of One Class SVM. More...
class	Point
	Encapsulates a Point for feature vector representaion of data. More...
class	SVClustering
	An implementation of the Support Vector Clustering originally proposed by Ben-Hur et al (2001). More...
Typedefs
typedef adjacency_matrix< undirectedS >	UndirectedGraph
	Definition of and Undirected Graph as an Adjacency Matrix from the Boost Graph Library.

---

Detailed Description

Data Mining Library namespace.

---

Typedef Documentation

typedef adjacency_matrix<undirectedS> damina::UndirectedGraph

Definition of and Undirected Graph as an Adjacency Matrix from the Boost Graph Library.

Definition at line 40 of file SVClustering.h.

---