A novel sequence space related to L p $\mathcal{L}_{p}$ defined by Orlicz function with application in pattern recognition

Abstract

Abstract In the field of pattern recognition, clustering groups the data into different clusters on the basis of similarity among them. Many a time, the similarity level between data points is derived through a distance measure; so, a number of clustering techniques reliant on such a measure are developed. Clustering algorithms are modified by employing an appropriate distance measure due to the high versatility of a data set. The distance measure becomes appropriate in clustering algorithm if weights assigned at the components of the distance measure are in concurrence to the problem. In this paper, we propose a new sequence space M ( ϕ , p , F ) $\mathcal{{M}} ( \phi,p,\mathcal{{F}} )$ related to L p $\mathcal{L}_{p}$ using an Orlicz function. Many interesting properties of the sequence space M ( ϕ , p , F ) $\mathcal{{M}} ( \phi,p,\mathcal{{F}} )$ are established by the help of a distance measure, which is also used to modify the k-means clustering algorithm. To show the efficacy of the modified k-means clustering algorithm over the standard k-means clustering algorithm, we have implemented them for two real-world data set, viz. a two-moon data set and a path-based data set (borrowed from the UCI repository). The clustering accuracy obtained by our proposed clustering algoritm outperformes the standard k-means clustering algorithm.

Keywords

• clustering
• double sequence
• k-means clustering
• Orlicz function