DocumentCode
560320
Title
Review of MIR-Max Algorithm and Potential Improvements
Author
Raghav, Akshyadeep ; Hasan, Raza
Author_Institution
Sch. of Comput., Staffordshire Univ., Stafford, UK
Volume
1
fYear
2011
fDate
26-27 Nov. 2011
Firstpage
554
Lastpage
558
Abstract
This paper discusses in depth the different parts of the MIR-max clustering algorithm with respect to the problem of diagnosing river quality. An equivalent information theoretic measure is proposed in this paper for clustering which is based on conditional entropy. The original mutual information method of clustering is compared with the proposed conditional entropy of states given to the cluster. This information theoretic concept measures the quality of cluster in terms of uncertainty existing within a cluster. It is found that the measure of conditional entropy is also useful for quantifying the ´fit´ of a new sample in a cluster. Indifferent mutual information is also described in the paper. Numeric examples are provided in this paper regarding the feasibility of the proposed measure for the clustering algorithm.
Keywords
entropy; environmental science computing; optimisation; pattern clustering; regression analysis; rivers; MIR-max clustering algorithm; conditional entropy; information theoretic measure; river quality diagnosis; Clustering algorithms; Educational institutions; Entropy; Mutual information; Pollution measurement; Rivers; Uncertainty; Biological Monitoring; Clustering; Conditional Entropy; Information & Regression-maximization; Mutual Information;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Management, Innovation Management and Industrial Engineering (ICIII), 2011 International Conference on
Conference_Location
Shenzhen
Print_ISBN
978-1-61284-450-3
Type
conf
DOI
10.1109/ICIII.2011.141
Filename
6115098
Link To Document