The DOI matches its Crossref record.
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Abstract
The KDD conference has seen remarkable growth since its origins as an IJCAI workshop in Detroit in 1989, evolving into a full-fledged research conference in 1995, underscoring the important role data mining as a field has played in extracting knowledge and actionable insights from vast troves of data that is being generated in the digital world around us. This year we received a record 755 submissions to the research program, from which 133 papers were accepted, for an aggregate acceptance rate of 17.6% (quite similar to recent years). Among the academic conferences, the KDD conference has typically more of an emphasis on research motivated by real-world applications. It is important to keep in mind that it is this synergy of research in areas like algorithms, computational geometry, database, graph theory, machine learning, natural language processing, statistics, visualization and many others when applied to problems arising in diverse fields such as web, medicine, climatology, marketing that drives our field forward, makes it vibrant and fun - who would know that ideas in computational geometry can be adapted to construct fast algorithms to improve online advertising and movie recommendations? The breadth of topics covered in this year's research program is truly comprehensive, including social networks, privacy, text mining, predictive modeling, time-series forecasting, spatial data analysis, geometry, and more. We are very fortunate to have 4 world-class keynote speakers this year spanning industry and academia, providing inspirational talks on cutting-edge techniques and issues in web mining, information networks, statistical inference for big data, and social computing. The process of whittling down the initial 734 submissions to the final set of 133 accepted papers required the coordination and time of a large number of willing volunteers. The program committee (PC) consisted of over 350 reviewers (PC members) and 50 senior PC members. In the first phase each submitted paper was automatically assigned to 3 reviewers (after a bidding process). Once the reviews from each of the 3 reviewers were completed, the program chairs rejected papers that did not receive much support from any of the reviewers. We rejected 259 papers at this stage. Special care was taken to minimize the error of rejecting a potentially good paper at this stage. The papers that survived the first phase were assigned to the senior PC members based on their bids, they had the option of initiating a discussion for any of their papers, e.g., if there was significant divergence in scores among reviewers, or if a paper was on the borderline of being accepted. Following the discussion phase, the senior PC members provided a recommendation score and a detailed meta-review for each paper. In the final phase, we (the program chairs) analyzed all of this information, starting with the obvious accept and reject decisions, and then gradually focusing in more detail on the papers near the borderline, seeking additional reviews and input from the PC and senior PC members where appropriate. We also initiated a shepherding phase with 15 papers having the opportunity of fixing mild issues we thought would be possible to address before they can be accepted. 13 of them were accepted after thorough revisions. Finally, it is quite likely that in hindsight some worthy papers may have been rejected as part of this process - these errors are an unfortunate reality of modern computer science conferences, and hard to avoid when a very large number of decisions have to be made over a short time span based on a subjective reviewing process. Nevertheless, we, the PC chairs, are responsible for those unfortunate errors and welcome suggestions on the matter.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The Role of Big Data and Predictive Analytics in Retailing
Bradlow, E. T., Gangwar, M., Kopalle, P., & Voleti, S. (2017) · Journal of Retailing · doi:10.1016/j.jretai.2016.12.004 · Cited by 516
Aceto, G., Persico, V., & Pescapé, A. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.02.008 · Cited by 504
MIFS-ND: A mutual information-based feature selection method
Hoque, N., Bhattacharyya, D. K., & Kalita, J. K. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.04.019 · Cited by 442
Holzinger, A., Malle, B., Saranti, A., & Pfeifer, B. (2021) · Information Fusion · doi:10.1016/j.inffus.2021.01.008 · Cited by 352
Query expansion techniques for information retrieval: a survey
Azad, H. K., & Deepak, A. (2019) · Information Processing & Management · doi:10.1016/j.ipm.2019.05.009 · Cited by 313
Liu, X., Su, Y., Hu, T., Yang, Q., Liu, B., Deng, Y., Tang, H., Tang, Z., Fang, J., & Guo, Q. (2022) · Remote Sensing of Environment · doi:10.1016/j.rse.2021.112844 · Cited by 270
A survey on data fusion in internet of things: Towards secure and privacy-preserving fusion
Ding, W., Jing, X., Yan, Z., & Yang, L. T. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.12.001 · Cited by 230
Mapping Cilento: using geotagged social media data to characterize tourist flows in southern Italy
Chua, A., Servillo, L., Marcheggiani, E., & Moere, A. V. (2016) · Tourism Management · doi:10.1016/j.tourman.2016.06.013 · Cited by 216
Interpretable dropout prediction: towards XAI-based personalized intervention
Nagy, M., & Molontay, R. (2024) · International Journal of Artificial Intelligence in Education · doi:10.1007/s40593-023-00331-8 · Cited by 179
Do display ads influence search? Attribution and dynamics in online advertising
Kireyev, P., Pauwels, K., & Gupta, S. (2016) · International Journal of Research in Marketing · doi:10.1016/j.ijresmar.2015.09.007 · Cited by 173
Predicting probable Alzheimer's disease using linguistic deficits and biomarkers
Orimaye, S. O., Wong, J. S.-M., Golden, K. J., Wong, C. P., & Soyiri, I. N. (2017) · BMC Bioinformatics · doi:10.1186/s12859-016-1456-0 · Cited by 158
Iqbal, R., Doctor, F., More, B., Mahmud, S., & Yousuf, U. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2017.10.021 · Cited by 155
Pliakos, K., Joo, S.-H., Park, J. Y., Cornillie, F., Vens, C., & Van den Noortgate, W. (2019) · Computers & Education · doi:10.1016/j.compedu.2019.04.009 · Cited by 149
Data fusion in cyber-physical-social systems: State-of-the-art and perspectives
Wang, P., Yang, L. T., Li, J., Chen, J., & Hu, S. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.11.002 · Cited by 127
What makes cancer information viral on social media?
Wang, X., Chen, L., Shi, J., & Peng, T.-Q. (2019) · Computers in Human Behavior · doi:10.1016/j.chb.2018.12.024 · Cited by 93
Triguero, I., Molina, D., Poyatos, J., Del Ser, J., & Herrera, F. (2024) · Information Fusion · doi:10.1016/j.inffus.2023.102135 · Cited by 90
Aspect-based Sentiment Analysis of Scientific Reviews
Chakraborty, S., Goyal, P., & Mukherjee, A. (2020) · Proceedings of the ACM/IEEE Joint Conference on Digital Libraries in 2020 · doi:10.1145/3383583.3398541 · Cited by 63
Interpretable generalized additive neural networks
Kraus, M., Tschernutter, D., Weinzierl, S., & Zschech, P. (2024) · European Journal of Operational Research · doi:10.1016/j.ejor.2023.06.032 · Cited by 59
Using echo state networks for classification: A case study in Parkinson's disease diagnosis
Lacy, S. E., Smith, S. L., & Lones, M. A. (2018) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2018.02.002 · Cited by 55
SafePath: Differentially-private publishing of passenger trajectories in transportation systems
Al-Hussaeni, K., Fung, B. C. M., Iqbal, F., Dagher, G. G., & Park, E. G. (2018) · Computer Networks · doi:10.1016/j.comnet.2018.07.007 · Cited by 52
Distributed learning from multiple EHR databases: Contextual embedding models for medical events
Li, Z., Roberts, K., Jiang, X., & Long, Q. (2019) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2019.103138 · Cited by 44
Fairness metrics and bias mitigation strategies for rating predictions
Ashokan, A., & Haas, C. (2021) · Information Processing & Management · doi:10.1016/j.ipm.2021.102646 · Cited by 47
Wang, R., Li, S., Cheng, L., Wong, M. H., & Leung, K. S. (2019) · BMC Bioinformatics · doi:10.1186/s12859-019-3283-6 · Cited by 37
Unsupervised tip-mining from customer reviews
Zhu, D., Lappas, T., & Zhang, J. (2018) · Decision Support Systems · doi:10.1016/j.dss.2018.01.011 · Cited by 32
Deep Learning Models for Serendipity Recommendations: A Survey and New Perspectives
Fu, Z., Niu, X., & Maher, M. L. (2024) · ACM Computing Surveys · doi:10.1145/3605145 · Cited by 30
Misztal-Radecka, J., & Indurkhya, B. (2021) · Information Processing & Management · doi:10.1016/j.ipm.2021.102519 · Cited by 29
A technical survey on statistical modelling and design methods for crowdsourcing quality control
Jin, Y., Carman, M., Zhu, Y., & Xiang, Y. (2020) · Artificial Intelligence · doi:10.1016/j.artint.2020.103351 · Cited by 28
Insights into bootstrap percolation: Its equivalence with k-core percolation and the giant component
Di Muro, M. A., Valdez, L. D., Stanley, H. E., Buldyrev, S. V., & Braunstein, L. A. (2019) · Physical Review E · doi:10.1103/physreve.99.022311 · Cited by 18
MADDC: Multi-Scale Anomaly Detection, Diagnosis and Correction for Discrete Event Logs
Wang, X., Yang, L., Li, D., Ma, L., He, Y., Xiao, J., Liu, J., & Yang, Y. (2022) · Proceedings of the 38th Annual Computer Security Applications Conference · doi:10.1145/3564625.3567972 · Cited by 16
Pan, Q., Li, S., Zheng, T., Ma, F., & Huang, J. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.123227 · Cited by 7
Metadata
- Publisher
- ACM
- Published
- 2012-08-12
- OpenAlex
- W4248949446
- Cited by
- 1,454
- References
- 0
- Type
- paratext
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.