This paper presents a novel method for classification, which makes use of the models built by the lattice machine (LM) [1,3 ]. The LM approximates data resulting in, as a model of data, a set of hyper tuples that are equilabelled, supported and maximal . The method presented in this paper uses the LM model of data to classify new data with a view to maximising the density of the model. Experiments show that this method, when used with the LM, outperforms the C2 algorithm in [3 ] and it is comparable to the C5.0 classification algorithm.
Citation:
Hui Wan, David Bell, Diu Liu, Ivo Düntsch, "Classification through Maximizing Density," icdm, pp.655, First IEEE International Conference on Data Mining (ICDM'01), 2001