Time Complexity of Rough Clustering: GAs versus K-Means

Pawan Lingras, Y. Y. Yao. Time Complexity of Rough Clustering: GAs versus K-Means. In James J. Alpigini, James F. Peters, Jacek Skowronek, Ning Zhong, editors, Rough Sets and Current Trends in Computing, Third International Conference, RSCTC 2002, Malvern, PA, USA, October 14-16, 2002, Proceedings. Volume 2475 of Lecture Notes in Computer Science, pages 263-270, Springer, 2002. [doi]

@inproceedings{LingrasY02,
  title = {Time Complexity of Rough Clustering: GAs versus K-Means},
  author = {Pawan Lingras and Y. Y. Yao},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2475/24750263.htm},
  researchr = {https://researchr.org/publication/LingrasY02},
  cites = {0},
  citedby = {0},
  pages = {263-270},
  booktitle = {Rough Sets and Current Trends in Computing, Third International Conference, RSCTC 2002, Malvern, PA, USA, October 14-16, 2002, Proceedings},
  editor = {James J. Alpigini and James F. Peters and Jacek Skowronek and Ning Zhong},
  volume = {2475},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-44274-X},
}