Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 658

The DOI matches its Crossref record.

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining

·2003

Abstract

KDD-2003, the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, was held in Washington, DC, U.S.A., on August 24-27, 2003. KDD is the leading international forum for the exchange of research results and practical experience in field of knowledge discovery and data mining. As the mountains of data available to organizations and individuals continue to grow without limit, and the need to extract useful knowledge from them becomes ever more intense, scientists, government workers and business people turn to the KDD community for solutions. The volume you have in your hands (or on your screen) contains a snapshot of a year of developments in this field; we hope you find it useful and rewarding.The KDD-2003 technical program featured two parallel research tracks and an industrial/government track. The latter was the result of expanding the scope of KDD's industrial track to reflect the increased importance of knowledge discovery and data mining in government and vice-versa. The program also featured three keynote speakers, nine workshops, seven tutorials and two panels. The 2003 KDD Cup competition focused on mining citation networks and data cleaning in large bibliographic repositories. Dozens of exhibits from vendors and other organizations added to the ferment, and underscored the conference's dual role as an industry and academic event.Continuing its tradition of collocation with related conferences, this year KDD was collocated with ICML-2003, the Twentieth International Conference on Machine Learning. The two conferences held a joint session on the first day of KDD (last of ICML), which featured a selection of papers from the two conferences and a joint keynote speaker. COLT-2003, the Sixteenth Annual Conference on Computational Learning Theory, was also collocated with KDD and ICML.We received a large number of submissions, and the selection process was extremely competitive. Each paper was independently reviewed by three members of the program committee for originality, significance, technical quality, and clarity of presentation. This was followed by discussion among the reviewers and final decisions. Of the 258 research track submissions received, 34 were accepted as full papers for oral presentation, and 36 were accepted for poster presentation (13% and 14% of submissions, respectively). The industrial/government track received 40 submissions, of which 12 were accepted for oral presentation and 10 were accepted for poster presentation (30% and 25%). Additionally, ne research submission was reassigned to the industrial/government track, and accepted for oral presentation there.The resulting program was notable for its diversity and vitality. Alongside traditional KDD topics like classification, clustering, frequent sets, scalability, and temporal data, we also saw papers in rapidly growing areas like graph and relational mining, data streams, semi-structured data, and privacy. Application areas included the Web, bioinformatics, health care, marketing, crime-fighting, and many others.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/956750

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 658

Metadata

Publisher
ACM
Published
2003-08-24
OpenAlex
W4230197362
Cited by
658
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. https://app.cochat.ai/papers/10.1145/956750
The paper
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. (2003). https://doi.org/10.1145/956750

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.