A HYBRID CLUSTERING PROCEDURE FOR CONCENTRIC AND CHAIN-LIKE CLUSTERSNARASIMHA MURTY M; KRISHNA G.1981; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1981; VOL. 10; NO 6; PP. 397-412; BIBL. 8 REF.Article

A COMPUTATIONALLY EFFICIENT TECHNIQUE FOR DATA-CLUSTERINGNARASIMHA MURTY M; KRISHNA G.1980; PATTERN RECOGNIT.; GBR; DA. 1980; VOL. 12; NO 3; PP. 153-158; BIBL. 6 REF.Article

Two-level k-means clustering algorithm for k-τ relationship establishment and linear-time classificationCHITTA, Radha; NARASIMHA MURTY, M.Pattern recognition. 2010, Vol 43, Num 3, pp 796-804, issn 0031-3203, 9 p.Article

Extended subspace methods of pattern recognitionPRAKASH, M; NARASIMHA MURTY, M.Pattern recognition letters. 1996, Vol 17, Num 11, pp 1131-1139, issn 0167-8655Article

Off-line signature verification using genetically optimized weighted featuresRAMESH, V. E; NARASIMHA MURTY, M.Pattern recognition. 1999, Vol 32, Num 2, pp 217-233, issn 0031-3203Article

Clustering with evolution strategiesPHANENDRA BABU, G; NARASIMHA MURTY, M.Pattern recognition. 1994, Vol 27, Num 2, pp 321-329, issn 0031-3203Article

Knowledge-based clustering scheme for collection management and retrieval of library booksNARASIMHA MURTY, M; JAIN, A. K.Pattern recognition. 1995, Vol 28, Num 7, pp 949-963, issn 0031-3203Article

Structural aspects of semantic-directed clustersSHEKAR, B; NARASIMHA MURTY, M; KRISHNA, G et al.Pattern recognition. 1989, Vol 22, Num 1, pp 65-74, issn 0031-3203Article

Cauchy annealing schedule : An annealing schedule for boltzmann selection scheme in evolutionary algorithmsDUKKIPATI, Ambedkar; NARASIMHA MURTY, M; BHATNAGAR, Shalabh et al.Congress on evolutionary computation. 2004, isbn 0-7803-8515-2, 2Vol, vol 1, 55-62Conference Paper

A near-optimal initial seed value selection in K-means algorithm using a genetic algorithmPHANENDRA BABU, G; NARASIMHA MURTY, M.Pattern recognition letters. 1993, Vol 14, Num 10, pp 763-769, issn 0167-8655Article

A knowledge-based clustering schemeSHEKAR, B; NARASIMHA MURTY, M; KRISHNA, G et al.Pattern recognition letters. 1987, Vol 5, Num 4, pp 253-259, issn 0167-8655Article

Combining heterogeneous classifiers for relational databasesMANJUNATH, Geetha; NARASIMHA MURTY, M; SITARAM, Dinkar et al.Pattern recognition. 2013, Vol 46, Num 1, pp 317-324, issn 0031-3203, 8 p.Article

Tasklets: enabling end user programming of web widgetsMANJUNATH, Geetha; NARASIMHA MURTY, M; SITARAM, Dinkar et al.International journal of Web engineering and technology. 2013, Vol 8, Num 3, pp 264-290, issn 1476-1289, 27 p.Article

An efficient parzen-window based network intrusion detector using a pattern synthesis techniqueVISWANATH, P; NARASIMHA MURTY, M; KAMBALA, Satish et al.Lecture notes in computer science. 2005, pp 799-804, issn 0302-9743, isbn 3-540-30506-8, 1Vol, 6 p.Conference Paper

Optimal thresholding using multi-state stochastic connectionist approachPHANENDRA BABU, G; NARASIMHA MURTY, M.Pattern recognition letters. 1995, Vol 16, Num 1, pp 11-18, issn 0167-8655Article

A genetic approach for selection of (near-) optimal subsets of principal components for discriminationPRAKASH, M; NARASIMHA MURTY, M.Pattern recognition letters. 1995, Vol 16, Num 8, pp 781-787, issn 0167-8655Article

Incremental learning from examples using HC-expressionsBHANDARU, M. K; NARASIMHA MURTY, M.Pattern recognition. 1991, Vol 24, Num 4, pp 273-282, issn 0031-3203, 10 p.Article

Efficient median based clustering and classification techniques for protein sequencesVIJAYA, P. A; NARASIMHA MURTY, M; SUBRAMANIAN, D. K et al.Pattern analysis and applications (Print). 2006, Vol 9, Num 2-3, pp 243-255, issn 1433-7541, 13 p.Article

A new data structure HC-expression for learning from examplesCHITOOR, S. S; NARASIMHA MURTY, M; BHANDARU, M. K et al.Pattern recognition. 1991, Vol 24, Num 1, pp 19-29, issn 0031-3203, 11 p.Article

Classification of run-length encoded binary dataRAVINDRA BABU, T; NARASIMHA MURTY, M; AGRAWAL, V. K et al.Pattern recognition. 2007, Vol 40, Num 1, pp 321-323, issn 0031-3203, 3 p.Article

An efficient hybrid hierarchical agglomerative clustering (HHAC) technique for partitioning large data setsVIJAYA, P. A; NARASIMHA MURTY, M; SUBRAMANIAN, D. K et al.Lecture notes in computer science. 2005, pp 583-588, issn 0302-9743, isbn 3-540-30506-8, 1Vol, 6 p.Conference Paper

On simultaneous selection of prototypes and features in large dataRAVINDRA BABU, T; NARASIMHA MURTY, M; AGRAWAL, V. K et al.Lecture notes in computer science. 2005, pp 595-600, issn 0302-9743, isbn 3-540-30506-8, 1Vol, 6 p.Conference Paper

A rough fuzzy approach to web usage categorizationASHARAF, S; NARASIMHA MURTY, M.Fuzzy sets and systems. 2004, Vol 148, Num 1, pp 119-129, issn 0165-0114, 11 p.Article

Growing subspace pattern recognition methods and their neural-network modelsPRAKASH, M; NARASIMHA MURTY, M.IEEE transactions on neural networks. 1997, Vol 8, Num 1, pp 161-168, issn 1045-9227Article