Open Access   Article Go Back

Implementation of Data Mining Techniques to Detect Ranking Fraud

M. Mary Priyadharshini1 , C. Premila Rosy2

Section:Research Paper, Product Type: Journal Paper
Volume-07 , Issue-04 , Page no. 59-61, Feb-2019

Online published on Feb 28, 2019

Copyright © M. Mary Priyadharshini, C. Premila Rosy . 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.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: M. Mary Priyadharshini, C. Premila Rosy, “Implementation of Data Mining Techniques to Detect Ranking Fraud,” International Journal of Computer Sciences and Engineering, Vol.07, Issue.04, pp.59-61, 2019.

MLA Style Citation: M. Mary Priyadharshini, C. Premila Rosy "Implementation of Data Mining Techniques to Detect Ranking Fraud." International Journal of Computer Sciences and Engineering 07.04 (2019): 59-61.

APA Style Citation: M. Mary Priyadharshini, C. Premila Rosy, (2019). Implementation of Data Mining Techniques to Detect Ranking Fraud. International Journal of Computer Sciences and Engineering, 07(04), 59-61.

BibTex Style Citation:
@article{Priyadharshini_2019,
author = {M. Mary Priyadharshini, C. Premila Rosy},
title = {Implementation of Data Mining Techniques to Detect Ranking Fraud},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {2 2019},
volume = {07},
Issue = {04},
month = {2},
year = {2019},
issn = {2347-2693},
pages = {59-61},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=721},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=721
TI - Implementation of Data Mining Techniques to Detect Ranking Fraud
T2 - International Journal of Computer Sciences and Engineering
AU - M. Mary Priyadharshini, C. Premila Rosy
PY - 2019
DA - 2019/02/28
PB - IJCSE, Indore, INDIA
SP - 59-61
IS - 04
VL - 07
SN - 2347-2693
ER -

           

Abstract

Mobile App market refers to fraudulent or deceptive activities which have a purpose of bumping up the Apps in the popularity list. It becomes more frequent for App developers to use adumbral means, such as inflating their Apps’ sales or posting phony App ratings, to commit Review cheats. While the importance of preventing ranking cheat has been widely recognized, there is limited understanding and research in this area. We propose a new algorithm for this kind of the problem using Marshal Classification scam identification technique for mobile Apps. Specifically, we first propose to accurately locate the ranking fraud by mining the active periods, namely leading sessions, of mobile Apps. Such leading sessions can find out the local anomaly instead of global anomaly of App rankings. Furthermore, we investigate three types of evidences, i.e., ranking based evidences, rating based evidences and review based evidences, by modelling Apps’ ranking, valuation, review and behaviours through analytical detection principle tests using Marshal Classification Scan Analysis Technique.

Key-Words / Index Term

Mobile Apps, ranking fraud detection, evidence aggregation, historical ranking records, rating and review

References

[1] (2014). [Online]. Available: http://en.wikipedia.org/wiki/ cohen’s_kappa
[2] (2014). [Online]. Available: http://en.wikipedia.org/wiki/information_retrieval.
[3] (2012). [Online]. Available: https://developer.apple.com/news/index.php?id=02062012a
[4] (2012). [Online]. Available: http://venturebeat.com/2012/07/03/apples-crackdown-on-app-ranking-manipulation/
[5] (2012). [Online]. Available: http://www.ibtimes.com/applethreatens- crackdown-biggest-app-store-ranking-fra ud-406764
[6] (2012). [Online]. Available: http://www.lextek.com/manuals/onix/index.html
[7] (2012). [Online]. Available: http://www.ling.gu.se/lager/mogul/porter-stemmer.
[8] L. Azzopardi, M. Girolami, and K. V. Risjbergen, “Investigating the relationship between language model perplexity and ir precision- recall measures,” in Proc. 26th Int. Conf. Res. Develop. Inform. Retrieval, 2003, pp. 369–370.
[9] D. M. Blei, A. Y. Ng, and M. I. Jordan, “Latent Dirichlet allocation,” J. Mach. Learn. Res., pp. 993–1022, 2003.
[10] Y. Ge, H. Xiong, C. Liu, and Z.-H. Zhou, “A taxi driving fraud detection system,” in Proc. IEEE 11th Int. Conf. Data Mining, 2011, pp. 181–190.
[11] D. F. Gleich and L.-h. Lim, “Rank aggregation via nuclear norm minimization,” in Proc. 17th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2011, pp. 60–68.
[12] T. L. Griffiths and M. Steyvers, “Finding scientific topics,” Proc. Nat. Acad. Sci. USA, vol. 101, pp. 5228–5235, 2004.
[13] G. Heinrich, Parameter estimation for text analysis, “ Univ. Leipzig, Leipzig, Germany, Tech. Rep., http://faculty.cs.byu.edu/~ringger/CS601R/papers/Heinrich-GibbsLDA.pdf, 2008.
[14] N. Jindal and B. Liu, “Opinion spam and analysis,” in Proc. Int. Conf. Web Search Data Mining, 2008, pp. 219–230.
[15] J. Kivinen and M. K. Warmuth, “Additive versus exponentiated gradient updates for linear prediction,” in Proc. 27th Annu. ACM Symp. Theory Comput., 1995, pp. 209–218.
[16] A. Klementiev, D. Roth, and K. Small, “An unsupervised learning.
[17] A. Klementiev, D. Roth, and K. Small, “Unsupervised rank aggregation with distance-based models,” in Proc. 25th Int. Conf. Mach. Learn., 2008, pp. 472–479.
[18] A. Klementiev, D. Roth, K. Small, and I. Titov, “Unsupervised rank aggregation with domain-specific expertise,” in Proc. 21st Int. Joint Conf. Artif. Intell., 2009, pp. 1101–1106.
[19] E.-P. Lim, V.-A. Nguyen, N. Jindal, B. Liu, and H. W. Lauw, “Detecting product review spammers using rating behaviors,” in Proc. 19thACMInt. Conf. Inform. Knowl. Manage., 2010, pp. 939–948.
[20] Y.-T. Liu, T.-Y. Liu, T. Qin, Z.-M. Ma, and H. Li, “Supervised rank aggregation,” in Proc. 16th Int. Conf. World Wide Web, 2007, pp. 481–490.
[21] A. Mukherjee, A. Kumar, B. Liu, J. Wang, M. Hsu, M. Castellanos, and R. Ghosh, “Spotting opinion spammers using behavioral footprints,” in Proc. 19th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2013, pp. 632–640.
[22] A. Ntoulas, M. Najork, M. Manasse, and D. Fetterly, “Detecting spam web pages through content analysis,” in Proc. 15th Int. Conf. World Wide Web, 2006, pp. 83–92.
[23] G. Shafer, A Mathematical Theory of Evidence. Princeton, NJ, USA: Princeton Univ. Press, 1976.
[24] K. Shi and K. Ali, “Getjar mobile application recommendations with very sparse datasets,” in Proc. 18th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2012, pp. 204–212.
[25] N. Spirin and J. Han, “Survey on web spam detection: Principles and algorithms,” SIGKDD Explor. Newslett., vol. 13, no. 2, pp. 50–64, May 2012.