The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).
If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.
Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.
BibTex Citation Data :
@article{JOIV1017, author = {Yasi Dani and Maria Ginting}, title = {Classification of Predicting Customer Ad Clicks Using Logistic Regression and k-Nearest Neighbors}, journal = {JOIV : International Journal on Informatics Visualization}, volume = {7}, number = {1}, year = {2023}, keywords = {machine learning algorithm; logistic regression; k-nearest neighbors; supervised classification; ad-click}, abstract = {Nowadays, conventional marketing techniques have changed to online (digital) marketing techniques requiring internet access. Online marketing techniques have many advantages, especially in terms of cost efficiency and fast information delivery to the public. Therefore, many companies are interested in online marketing and advertising on social media platforms and websites. However, one of the challenges for companies in online marketing is determining the right target consumers since if they target consumers who are not interested in buying the product, the advertising costs will be high. One use of online advertising is clicks on ads which is a marketing measurement of how many users click on the online ad. Thus, companies need a click prediction system to know the right target consumers. And different types of advertisers and search engines rely on modeling to predict ad clicks accurately. This paper constructs the customer ad clicks prediction model using the machine learning approach that becomes more sophisticated in effectively predicting the probability of a click. We propose two classification algorithms: the logistic regression (LR) classifier, which produces probabilistic outputs, and the k-nearest neighbors (k-NN) classifier, which produces non-probabilistic outputs. Furthermore, this study compares the two classification algorithms and determines the best algorithm based on their performance. We calculate the confusion matrix and several metrics: precision, recall, accuracy, F1-score, and AUC-ROC. The experiments show that the logistic regression algorithm performs best on a given dataset.}, issn = {2549-9904}, pages = {98--104}, doi = {10.30630/joiv.7.1.1017}, url = {https://joiv.org/index.php/joiv/article/view/1017} }
Refworks Citation Data :
@article{{JOIV}{1017}, author = {Dani, Y., Ginting, M.}, title = {Classification of Predicting Customer Ad Clicks Using Logistic Regression and k-Nearest Neighbors}, journal = {JOIV : International Journal on Informatics Visualization}, volume = {7}, number = {1}, year = {2023}, doi = {10.30630/joiv.7.1.1017}, url = {} }Refbacks
- There are currently no refbacks.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
__________________________________________________________________________
JOIV : International Journal on Informatics Visualization
ISSN 2549-9610 (print) | 2549-9904 (online)
Organized by Department of Information Technology - Politeknik Negeri Padang, and Institute of Visual Informatics - UKM and Soft Computing and Data Mining Centre - UTHM
W : http://joiv.org
E : joiv@pnp.ac.id, hidra@pnp.ac.id, rahmat@pnp.ac.id
View JOIV Stats
is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.