DocumentCode
2397538
Title
Density maximisation classification in the lattice machine
Author
Wang, Hui ; Liu, Chang
Author_Institution
Sch. of Inf. & Software Eng., Ulster Univ., Jordanstown
fYear
2006
fDate
Sept. 2006
Firstpage
12
Lastpage
16
Abstract
This paper reviews the lattice machine classification framework (H. Wang et al., 1999), (Hui Wang et al., 2000), (Hui Wang et al., 2004) and its classification methods, in particular the density maximisation method (Hui Wang et al., 2003). This paper also suggests a different way of estimating density, which is based on the contextual probability (H. Wang and W. Dubitzky, 2005). The lattice machine approximates data resulting in, as a model of data, a set of hypertuples that are equilabelled, supported and maximal. Such a model can be used for classification with the C2 method (Hui Wang et al., 2000) or the density maximisation method (Hui Wang et al., 2003). The density maximisation method uses the lattice machine model of data to classify new data with a view to maximising the density of the model. The density maximisation method uses a simple definition of density. In this paper we suggest using a different density estimation method, which is based on the contextual probability
Keywords
estimation theory; optimisation; pattern classification; probability; C2 method; contextual probability; data classification; density estimation; density maximisation classification; lattice machine classification; Clustering algorithms; Decision trees; Intelligent systems; Labeling; Lattices; Logic programming; Machine intelligence; Partitioning algorithms; Software algorithms; Software engineering; classification; contextual probability; density; hypertuple; lattice machine;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems, 2006 3rd International IEEE Conference on
Conference_Location
London
Print_ISBN
1-4244-01996-8
Electronic_ISBN
1-4244-01996-8
Type
conf
DOI
10.1109/IS.2006.348386
Filename
4155393
Link To Document