default search action
Paul S. Bradley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j9]Paul S. Bradley:
Implications of Big Data Analytics on Population Health Management. Big Data 1(3): 152-159 (2013)
2000 – 2009
- 2005
- [j8]Charu C. Aggarwal, Paul S. Bradley:
On the Use of Wavelet Decomposition for String Classification. Data Min. Knowl. Discov. 10(2): 117-139 (2005) - 2003
- [c12]Paul S. Bradley:
Data Mining as an Automated Service. PAKDD 2003: 1-13 - 2002
- [j7]Paul S. Bradley, Johannes Gehrke, Raghu Ramakrishnan, Ramakrishnan Srikant:
Scaling mining algorithms to large databases. Commun. ACM 45(8): 38-43 (2002) - 2001
- [c11]Usama M. Fayyad, Neal Rothleder, Paul S. Bradley:
E-business enterprise data mining. KDD Tutorials 2001 - [c10]Cheng Yang, Usama M. Fayyad, Paul S. Bradley:
Efficient discovery of error-tolerant frequent itemsets in high dimensions. KDD 2001: 194-203 - [c9]Igor V. Cadez, Paul S. Bradley:
Model Based Population Tracking and Automatic Detection of Distribution Changes. NIPS 2001: 1345-1352 - 2000
- [j6]Paul S. Bradley, Olvi L. Mangasarian:
k-Plane Clustering. J. Glob. Optim. 16(1): 23-32 (2000) - [j5]Paul S. Bradley, Sunita Sarawagi, Usama M. Fayyad:
Editorial. SIGKDD Explor. 2(1) (2000) - [j4]Paul S. Bradley, Usama M. Fayyad, Sunita Sarawagi, Kyuseok Shim:
Editorial. SIGKDD Explor. 2(2) (2000) - [c8]Paul S. Bradley, Cory Reina, Usama M. Fayyad:
Clustering Very Large Databases Using EM Mixture Models. ICPR 2000: 2076-2080
1990 – 1999
- 1999
- [j3]Paul S. Bradley, Usama M. Fayyad, Olvi L. Mangasarian:
Mathematical Programming for Data Mining: Formulations and Challenges. INFORMS J. Comput. 11(3): 217-238 (1999) - [c7]Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S. Bradley:
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions. KDD 1999: 223-232 - 1998
- [j2]Paul S. Bradley, Olvi L. Mangasarian, J. Ben Rosen:
Parsimonious Least Norm Approximation. Comput. Optim. Appl. 11(1): 5-21 (1998) - [j1]Paul S. Bradley, Olvi L. Mangasarian, W. Nick Street:
Feature Selection via Mathematical Programming. INFORMS J. Comput. 10(2): 209-217 (1998) - [c6]Paul S. Bradley, Olvi L. Mangasarian:
Parsimonious side propagation. ICASSP 1998: 1873-1876 - [c5]Paul S. Bradley, Olvi L. Mangasarian:
Feature Selection via Concave Minimization and Support Vector Machines. ICML 1998: 82-90 - [c4]Paul S. Bradley, Usama M. Fayyad:
Refining Initial Points for K-Means Clustering. ICML 1998: 91-99 - [c3]Paul S. Bradley, Usama M. Fayyad, Cory Reina:
Scaling Clustering Algorithms to Large Databases. KDD 1998: 9-15 - [c2]Usama M. Fayyad, Cory Reina, Paul S. Bradley:
Initialization of Iterative Refinement Clustering Algorithms. KDD 1998: 194-198 - 1996
- [c1]Paul S. Bradley, Olvi L. Mangasarian, W. Nick Street:
Clustering via Concave Minimization. NIPS 1996: 368-374
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-03 20:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: