Probabilistic Model for Covering Algorithm

@inproceedings{Ling2007ProbabilisticMF,
  title={Probabilistic Model for Covering Algorithm},
  author={Zhang Ling and Wu Zao and Zhou Ying and Zhang Yah},
  year={2007}
}
It is necessary to bring global optimization in covering algorithm to improve its precision of classification. So a probabilistic model of covering algorithm is put forward in this paper. Firstly, the covering algorithm is ameliorated to kernel covering model (Gaussian function is the kernel function), then a kind of finite mixture probabilistic model for kernel covering model is introduced according to the probabilistic meaning of Gaussian function. Finally, the global optimization calculation… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

A study of algorithm of neural networks as classifiers and their application in text classification [Ph.D

  • Y. Zhou
  • Thesis]. Hefei: Anhui University,
  • 2006
2 Excerpts

Improvement on neighborhood covering algorithm and it’s application

  • LW Wang, T Wu, M Zhang, L. Zhang
  • Pattern Recognition and Artificial Intelligence,
  • 2003
1 Excerpt

The application of granularity of the quotient space theory in database and data warehouse

  • M Zhang, T Wu, LW Wang, JX. Cheng
  • Journal of the Computer Engineering and…
  • 2003

Similar Papers

Loading similar papers…