Total views : 73

An Enhanced Candidate Transaction Rank Accuracy Algorithm using SVM for Search Engines

Affiliations

  • Department of Computer Science, Bishop Heber College – 620017, Tiruchirappalli, Tamil Nadu, India

Abstract


Support Vector Machines (SVM) along with Hilltop associated techniques contain publicized headed for erect precise models other than the erudition chore usually requires a quadratic brainwashing, consequently the erudition chore for hefty datasets necessitates gigantic recall competence along with an elongated time. A up-to-the-minute augmentation, hilltop technique sloping SVM algorithm with linear or non-linear techniques in the proposition exertion in this article, which aims at classifying very hefty datasets on standard Page Rank for a website. The recent finite hilltop classifiers for building an incremental has extended based on SVM algorithm. The proposed algorithm has seemed to be very fast and could knob very hefty datasets in linear and non-linear classification chores. A case in point of the success is prearranged with the linear taxonomy into two modules of two million information positions in 50-measuremental contribution breathing space in various seconds with ECTRAA.

Keywords

Enhanced Candidate Transaction Rank Accuracy Algorithm, Hilltop, Page Rank, SVM Algorithm, Web Mining

Full Text:

 |  (PDF views: 83)

References


  • Iglesias JJA, Tiemblo A, Ledezma A, Sanchis A. Web News Mining in an Evolving Framework. Elsevier. 2016; 90–8.
  • Sikka P. Data Mining of Social Networks using clustering based SVM. International Journal of Research Review in Engineering Science & Technology. 2015; 4(1). ISSN: 22786643.
  • Qeli E, Omasits U, Goetze S, Stekhoven DJ, Frey JE, Basler K, Wollscheid B, Brunner E, Ahrens CH. Improved prediction of peptide detectability for targeted proteomics using a rank-based algorithm and organism-specific data. Elsevier, Journal of Proteomics. 2014; 108:269–83. Crossref.
  • Brahim BA, Liman M. Robust ensemble feature selection for high dimensional datasets. International Conference on High Performance Computing and Simulation, 2013. p.151–7.
  • Article. http://googlewebmastercentral.blogspot.in/2014/08 /https-as-ranking--signal.html. Accessed on 06-08-2014.
  • Saez JA, Galar M, Luengo J, Herrera F. INFFC: An iterative class noise filter based on the fusion of classifiers with noise sensitivity control. Elsevier, Information Fusion. 2016; 19–32. Crossref.
  • Mangasarian OL. Support Vector Machine Classification via Parameterless Robust Linear Programming. Data Mining Institute Technical Report, 2003 Mar. p. 1–12.
  • Mangasarian OL, Wild EW. Feature Selection for Nonlinear Kernel Support Vector Machines, Seventh IEEE International Conference on Data Mining – Workshops, IEEE Computer Society, 2007. p. 231–6.
  • Fung G, Mangasarian OL. Data selection for support vector machine classifiers. The sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2000. p. 64–70. Crossref.
  • Dessi A, Atzori M. A machine-learning approach to ranking RDF properties. Elsevier, Future Generation Computer Systems, 2016; 54:366–77. Crossref.
  • Claesen M, Smet F, Suykens JAK, Moor BD. A robust ensemble approach to learn from positive and unlabeled data using SVM base models. Elsevier, Neurocomputing. 2015; 160:73–84. Crossref.
  • Article. http://torrentfreak.com/googlesnew-downrankinghitspirate-sites-hard-141023/. Accessed on 23-10-2014.
  • Killoran JG. How to use Search Engine Optimization Techniques to increase Website Visibility. IEEE Transactions on Professional Communication. 2015; 56(1):50–66.Crossref.
  • Ashish C, Suaib M. A Survey on Web Spam and Spam 2.0. International Journal of Advanced Computer Research. 2014; 4(2):635–44.
  • Chandra A, Suaib M, Beg R. Google Search Algorithm updates against web spam. Department of Computer Science & Engineering, Integral University; Lucknow: 2015 Mar. p. 1–10.
  • Available from website:http://www.technicalsymposium.com

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.