Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 187053, 9 pages
http://dx.doi.org/10.1155/2015/187053
Research Article

Bayesian-OverDBC: A Bayesian Density-Based Approach for Modeling Overlapping Clusters

1Department of Computer Engineering, Golpayegan University of Technology, Isfahan 87717-65651, Iran
2Department of Software Engineering, Faculty of Computer Engineering, University of Isfahan, Isfahan 81746-73441, Iran
3Department of Bio-Medical Engineering, University of Isfahan, Isfahan 81746-73441, Iran

Received 18 March 2015; Revised 14 June 2015; Accepted 21 October 2015

Academic Editor: Huaguang Zhang

Copyright © 2015 Mansooreh Mirzaie et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Harpaz and R. Haralick, “Exploiting the geometry of gene expression patterns for unsupervised learning,” in Proceedings of the 18th International Conference on Pattern Recognition (ICPR '06), pp. 670–674, IEEE, Hong Kong, August 2006. View at Publisher · View at Google Scholar · View at Scopus
  2. P. N. Tan, M. Steinbach, and V. Kumar, Introduction to Data Mining, Addison Wesley, 2011.
  3. M. Mirzaie, A. Barani, N. NematBakhsh, and M. Beigi, “OverDBC: a new density-based clustering method for detecting overlapped clusters from microarray data,” IDA Journal, vol. 19, no. 6, 2015. View at Google Scholar
  4. K. A. Heller and Z. Ghahramani, “A nonparametric Bayesian approach to modelling overlapping clusters,” in Proceedings of the 11th International Conference on Artificial Intelligence and Statistics (AISTATS '07), vol. 2 of JMLR Workshop and Conference Proceedings, pp. 187–194, San Juan, Puerto Rico, March 2007.
  5. A. H. Katherine and Z. Ghahramani, “A nonparametric Bayesian approach to modelling overlapping clusters,” in Proceedings of the 11th International Conference on Artificial Intelligence and Statistics (AISTATS '07), San Juan, Puerto Rico, March 2007.
  6. X. Bai, S. Luo, and Y. Zhao, “Entropy based soft K-means clustering,” in Proceedings of the IEEE International Conference on Granular Computing (GrC '08), pp. 107–110, August 2008.
  7. O. Alter, P. O. Brown, and D. Botstein, “Singular value decomposition for genome-wide expression data processing and modeling,” Proceedings of the National Academy of Sciences of the United States of America, vol. 97, no. 18, pp. 10101–10106, 2000. View at Publisher · View at Google Scholar · View at Scopus
  8. N. Jardine and R. Sibson, “The construction of hierarchic and non-hierarchic classifications,” Computer Journal, vol. 11, no. 2, pp. 177–184, 1968. View at Publisher · View at Google Scholar · View at Scopus
  9. P. Bertrand and E. Diday, “A visual representation of the compatibility between an order and a dissimilarity index: the pyramids,” Computational Statistics Quarterly, vol. 2, no. 1, pp. 31–41, 1985. View at Google Scholar
  10. R. N. Shepard and P. Arabie, “Additive clustering: representation of similarities as combinations of discrete overlapping properties,” Psychological Review, vol. 86, no. 2, pp. 87–123, 1979. View at Publisher · View at Google Scholar
  11. E. Segal, A. Battle, and D. Koller, “Decomposing gene expression into cellular processes,” in Proceedings of the 8th Pacific Symposium on Biocomputing (PSB '03), pp. 89–100, Lihue, Hawaii, USA, January 2003.
  12. A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” Journal of the Royal Statistical Society Series B: Methodological, vol. 39, no. 1, pp. 1–38, 1977. View at Google Scholar
  13. Y. Cheng and G. M. Church, “Biclustering of expression data,” in Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (ICMB '00), pp. 93–103, La Jolla, Calif, USA, August 2000.
  14. H. Shan and A. Banerjee, “Bayesian Co-clustering,” in Proceedings of the 8th IEEE International Conference on Data Mining (ICDM '08), pp. 530–539, Pisa, Italy, December 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. Y. Guan, J. G. Dy, D. Niu, and Z. Ghahramani, “Variational inference for nonparametric multiple clustering,” in Proceedings of the Workshop on Discovering, Summarizing and Using Multiple Clustering at the ACM SIGKDD International Conference on Knowledge Discovering and Data Mining (MultiClust '10), 2010.
  16. V. Mansinghka, E. Jonas, C. Petschulat, B. Cronin, P. Shafto, and J. Tenenbaum, “Cross-categorization: a method for discovering multiple overlapping clusterings,” in Proceedings of the Nonparametric Bayes Workshop at NIPS, Whistler, Canada, December 2009.
  17. T. T. Grifths and Z. Z. Ghahramani, “Infinite latent feature models and the Indian buffet process,” in Proceedings of the 20th Neural Information Processing Systems, Vancouver, Canada, December 2006.
  18. M. Ester, H. P. Kriegel, J. Sander, and X. Xu, “A density-based algorithm for discovering clusters in large spatial databases with noise,” in Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD '96), pp. 291–316, Portland, Ore, USA, August 1996.
  19. M. Ankerst, M. Breunig, H. P. Kriegel, and J. Sander, “OPTICS: ordering points to identify the clustering structure,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 49–60, Philadelphia, Pa, USA, June 1999.
  20. A. Hinneburg and H.-H. Gabriel, “Denclue 2.0: fast clustering based on kernel density estimation,” in Advances in Intelligent Data Analysis VII, vol. 4723 of Lecture Notes in Computer Science, pp. 70–80, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  21. S. Jukna, Extremal Combinatorics with Applications in Computer Science, Springer, New York, NY, USA, 2nd edition, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  22. K. A. Heller and Z. Ghahramani, “Bayesian hierarchical clustering,” in Proceedings of the 22nd International Conference on Machine Learning (ICML '05), pp. 297–304, August 2005. View at Publisher · View at Google Scholar · View at Scopus
  23. E. Alpaydın, Introduction to Machine Learning, The MIT Press, Cambridge, Mass, USA, 2010.
  24. T. L. Griffiths and Z. Ghahramani, “The Indian buffet process: an introduction and review,” Journal of Machine Learning Research, vol. 12, pp. 1185–1224, 2011. View at Google Scholar · View at Scopus
  25. E. Biçici and D. Yuret, “Locally scaled density based clustering,” in Adaptive and Natural Computing Algorithms, vol. 4431 of Lecture Notes in Computer Science, pp. 739–748, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  26. C. Fox and S. Roberts, “A tutorial on variational Bayesian inference,” Artificial Intelligence Review, vol. 38, no. 2, pp. 85–95, 2012. View at Publisher · View at Google Scholar
  27. M. Garcia-Hernandez, T. Z. Berardini, G. Chen et al., “TAIR: a resource for integrated Arabidopsis data,” Functional & Integrative Genomics, vol. 2, no. 6, pp. 239–253, 2002. View at Publisher · View at Google Scholar · View at Scopus
  28. P. T. Spellman, G. Sherlock, M. Q. Zhang et al., “Comprehensive identification of cell cycle-regulated genes of the yeast Saccharomyces cerevisiae by microarray hybridization,” Molecular Biology of the Cell, vol. 9, no. 12, pp. 3273–3297, 1998. View at Publisher · View at Google Scholar · View at Scopus
  29. W. M. Rand, “Objective criteria for the evaluation of clustering methods,” Journal of the American Statistical Association, vol. 66, no. 336, pp. 846–850, 1971. View at Publisher · View at Google Scholar
  30. L. M. Collins and C. W. Dent, “Omega: a general formulation of the rand index of cluster recovery suitable for non-disjoint solutions,” Multivariate Behavioral Research, vol. 23, no. 2, pp. 231–242, 1988. View at Publisher · View at Google Scholar