Highly Relevant Routing Recommendation Systems for Handling Few Data Using MDL Principle

@article{Puspitaningrum2018HighlyRR,
  title={Highly Relevant Routing Recommendation Systems for Handling Few Data Using MDL Principle},
  author={Diyah Puspitaningrum and I. S. W. B. Prasetya and P. A. Wicaksono},
  journal={ArXiv},
  year={2018},
  volume={abs/1804.06905}
}
A route recommendation system can provide better recommendation if it also takes collected user reviews into account, e.g. places that generally get positive reviews may be preferred. However, to classify sentiment, many classification algorithms existing today suffer in handling small data items such as short written reviews. In this paper we propose a model for a strongly relevant route recommendation system that is based on an MDL-based (Minimum Description Length) sentiment classification… CONTINUE READING
6
Twitter Mentions

Similar Papers

References

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

A Note on Two Problems in Connexion with Graphs

E. W. Dijkstra
  • Numer. Math. 1,
  • 1959
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

An Introduction to Support Vector Machines and Other Kernel-based Learning Methods

Nello Cristianini, John Shawe-Taylor
  • 2000
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Finding the K Shortest Loopless Paths in a Network

Jin Y. Yen, JIN Y. YENt
  • 2007
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Comparing top k lists

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL