The following pages link to M. Narasimha Murty (Q192453):
Displaying 29 items.
- (Q218240) (redirect page) (← links)
- Compression schemes for mining large datasets. A machine learning perspective (Q385878) (← links)
- Pattern recognition. An algorithmic approach. (Q632373) (← links)
- A rough fuzzy approach to web usage categorization (Q703313) (← links)
- Efficient bottom-up hybrid hierarchical clustering techniques for protein sequence classification (Q850138) (← links)
- Feature subspace SVMs (FS-SVMs) for high dimensional handwritten digit recognition (Q1046605) (← links)
- Simulated annealing for selecting optimal initial seeds in the \(K\)-means algorithm (Q1331167) (← links)
- An adaptive rough fuzzy single pass algorithm for clustering large data sets. (Q1425993) (← links)
- Bootstrapping for efficient handwritten digit recognition (Q1860114) (← links)
- Clan-based evolutionary approach for solving control problems (Q1913455) (← links)
- Machine learning in social networks. Embedding nodes, edges, communities, and graphs (Q2218679) (← links)
- A fast quasi-Newton method for semi-supervised SVM (Q2275982) (← links)
- Detecting outliers in categorical data through rough clustering (Q2311236) (← links)
- Gelfand-Yaglom-Perez theorem for generalized relative entropy functionals (Q2465342) (← links)
- Rough support vector clustering (Q2565842) (← links)
- Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification (Q2654244) (← links)
- Support Vector Machines and Perceptrons (Q2970763) (← links)
- Introduction to Pattern Recognition and Machine Learning (Q3008958) (← links)
- A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm (Q4287141) (← links)
- A divisive scheme for constructing minimal spanning trees in coordinate space (Q4310558) (← links)
- Tree structure for efficient data mining using rough sets (Q4421057) (← links)
- (Q4783448) (← links)
- Multi-dimensional semantic clustering of large databases for association rule mining (Q5938731) (← links)
- An incremental data mining algorithm for compact realization of prototypes (Q5948537) (← links)
- Rule prepending and post-pruning approach to incremental learning of decision lists (Q5950381) (← links)
- Efficient clustering of large data sets (Q5953143) (← links)
- Bit-level systolic implementation of discrete orthogonal transforms (Q5958666) (← links)
- An incremental prototype set building technique (Q5959620) (← links)
- Nonextensive triangle equality and other properties of Tsallis relative-entropy minimization (Q6469340) (← links)
