Sciweavers

2020 search results - page 50 / 404
» KDD Process Planning
Sort
View
KDD
2002
ACM
138views Data Mining» more  KDD 2002»
15 years 10 months ago
Learning to match and cluster large high-dimensional data sets for data integration
Part of the process of data integration is determining which sets of identifiers refer to the same real-world entities. In integrating databases found on the Web or obtained by us...
William W. Cohen, Jacob Richman
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
15 years 3 months ago
Collaborative Quality Filtering: Establishing Consensus or Recovering Ground Truth?
We present a algorithm based on factor analysis for performing collaborative quality filtering (CQF). Unlike previous approaches to CQF, which estimate the consensus opinion of a...
Jonathan Traupman, Robert Wilensky
KDD
1998
ACM
250views Data Mining» more  KDD 1998»
15 years 1 months ago
Data Mining for Direct Marketing: Problems and Solutions
Direct marketing is a process of identifying likely buyers of certain products and promoting the products accordingly. It is increasingly used by banks, insurance companies, and t...
Charles X. Ling, Chenghui Li
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
15 years 1 months ago
Proposal and Empirical Comparison of a Parallelizable Distance-Based Discretization Method
Many classification algorithms are designed to work with datasets that contain only discrete attributes. Discretization is the process of converting the continuous attributes of ...
Jesús Cerquides, Ramon López de M&aa...
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
15 years 1 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher