Nearest neighbor training of side effect machines for sequence classification

@article{Ashlock2010NearestNT,
  title={Nearest neighbor training of side effect machines for sequence classification},
  author={Daniel A. Ashlock and Andrew McEachern},
  journal={2010 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology},
  year={2010},
  pages={1-8}
}
Side effect machines operate by associating side effects with the states of a finite state machine. The use of side effect machines permits the researcher to leverage information stored in the state transition structure, making machines that might be identical as recognizers behave differently as classifiers. The side effect machines in this study associate a counter with each state so that the number of times each state is visited becomes a numerical feature associated with each state. The key… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-5 OF 5 CITATIONS

References

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

Comparison of distance indices between partitions, part i

  • V. Batagelj
  • Data, Science, and Classification, pages 21–28…
  • 2006
1 Excerpt

Pattern Recognition and Machine Learning

  • M. Bishop
  • Springer Verlag, New York,
  • 2006
1 Excerpt

Similar Papers

Loading similar papers…