Anil K. Jain

Anil K. Jain is a person.

• See: Clustering Algorithm, Gabor Filter.

---

---

References

• Google Scholar Author Page: http://scholar.google.com/citations?user=g-_ZXGsAAAAJ
• Wikipedia Person Page: http://en.wikipedia.org/wiki/Anil_K._Jain

2011

• (Chitta et al., 2011) ⇒ Radha Chitta, Rong Jin, Timothy C. Havens, and Anil K. Jain. (2011). “Approximate Kernel K-means: Solution to Large Scale Kernel Clustering.” In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2011). doi:10.1145/2020408.2020558

2004

• (Topchy et al., 2004) ⇒ Alexander Topchy, Behrouz Minaei-Bidgoli, Anil K. Jain, and William F. Punch. (2004). “Adaptive Clustering Ensembles.” In: Proceedings of the 17th International Conference on Pattern Recognition, (ICPR 2004).
  • QUOTE: Exploratory data analysis and, in particularly, data clustering can significantly benefit from combining multiple data partitions. Clustering ensembles can offer better solutions in terms of robustness, novelty and stability [1, 2, 3]. Moreover, their parallelization capabilities can be naturally used in distributed data mining.

1999

• (Jain et al., 1999) ⇒ Anil K. Jain, M. N. Murty, and P. J. Flynn. (1999). “Data Clustering: A Review.” In: ACM Computing Surveys (CSUR) Journal, 31(3). doi:10.1145/331499.331504

1990

• (Jain & Farrokhnia, 1990) ⇒ Anil K. Jain, and Farshid Farrokhnia. "Unsupervised texture segmentation using Gabor filters.” In: Proceedings of the International Conference on Systems, Man and Cybernetics.

1988

• (Jain & Dubes, 1988) ⇒ Anil K. Jain, and Richard C. Dubes. (1988). “Algorithms for Clustering Data." Prentice-Hall. ISBN:013022278X

---