Abstract
A pattern is a physical object or an abstract notion. If we are talking about the classes of animals, then a description of an animal would be a pattern. If we are talking about various types of balls, then a description of a ball (which may include the size and material of the ball) is a pattern. These patterns are represented by a set of descriptions. Depending on the classification problem, distinguishing features of the patterns are used. These features are called attributes. A pattern is the representation of an object by the values taken by the attributes. In the classification problem, we have a set of objects for which the values of the attributes are known. We have a set of classes and each object belongs to one of these classes. The classes for the case where the patterns are animals could be mammals, reptiles etc. In the case of the patterns being balls, the classes could be football, cricket ball, table tennis ball etc. Given a new pattern, the class of the pattern is to be determined. The choice of attributes and representation of patterns is a very important step in pattern classification. A good representation is one which makes use of discriminating attributes and also reduces the computational burden in pattern classification.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Han, Jaiwei, Jian Pei, Yiwen Yin and Runying Mao. Mining frequent patterns without candidate generation: A frequent pattern tree approach. Data Mining and Knowledge Discovery 8(1): 53–87. 2004.
Huttenlocher, D. P.,G. A. Klanderman and W. A. Rucklidge. Comparing images using the Hausdorff distance. IEEE Trans. on Pattern Analysis and Machine Intelligence 15(9): 850–863. 1993.
Jain, A. K. and D. Zongker. Feature selection: Evaluation, application and small sample performance. IEEE Trans. on Pattern Analysis and Machine Intelligence 19:153–157. 1997.
Kuncheva, L. and L. C. Jain. Nearest neighbor classifier: Simultaneous editing and feature selection. Pattern Recognition Letters 20:1149–1156. 1999.
Narendra, P. M. and K. Fukunaga. A branch and bound algorithm for feature subset selection. IEEE Trans. Computers 26(9): 917–922. 1977.
Pudil, P., J. Novovicova and J. Kittler. Floating search methods in feature selection. Pattern Recognition Letters 15: 1119–1125. 1994.
Siedlecki, W. and J. Sklansky. A note on genetic algorithms for large-scale feature selection. Pattern Recognition Letters 10: 335–347. 1989.
Somol, P., P. Pudil, J. Novovicova, P. Paclik. Adaptive floating search methods in feature selection. Pattern Recognition Letters 20: 1157–1163. 1999.
Yu, Bin and Baozong Yuan. A more efficient branch and bound algorithm for feature selection. Pattern Recognition 26(6): 883–889. 1993.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Universities Press (India) Pvt. Ltd.
About this chapter
Cite this chapter
Murty, M.N., Devi, V.S. (2011). Representation. In: Pattern Recognition. Undergraduate Topics in Computer Science, vol 0. Springer, London. https://doi.org/10.1007/978-0-85729-495-1_2
Download citation
DOI: https://doi.org/10.1007/978-0-85729-495-1_2
Publisher Name: Springer, London
Print ISBN: 978-0-85729-494-4
Online ISBN: 978-0-85729-495-1
eBook Packages: Computer ScienceComputer Science (R0)