default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoseph K. Bradley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j2]Xiangrui Meng, Joseph K. Bradley, Burak Yavuz, Evan Randall Sparks, Shivaram Venkataraman, Davies Liu, Jeremy Freeman, D. B. Tsai, Manish Amde, Sean Owen, Doris Xin, Reynold Xin, Michael J. Franklin, Reza Zadeh, Matei Zaharia, Ameet Talwalkar:
MLlib: Machine Learning in Apache Spark. J. Mach. Learn. Res. 17: 34:1-34:7 (2016)- [j1]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence. J. Mach. Learn. Res. 17: 58:1-58:47 (2016) - [c9]Firas Abuzaid, Joseph K. Bradley, Feynman T. Liang, Andrew Feng, Lee Yang, Matei Zaharia, Ameet Talwalkar:
Yggdrasil: An Optimized System for Training Deep Decision Trees at Scale. NIPS 2016: 3810-3818 - 2015
- [c8]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence. AISTATS 2015 - [c7]Michael Armbrust, Reynold S. Xin, Cheng Lian
, Yin Huai, Davies Liu, Joseph K. Bradley, Xiangrui Meng, Tomer Kaftan, Michael J. Franklin, Ali Ghodsi, Matei Zaharia:
Spark SQL: Relational Data Processing in Spark. SIGMOD Conference 2015: 1383-1394 - [i5]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence. CoRR abs/1505.01462 (2015) - [i4]Xiangrui Meng, Joseph K. Bradley, Burak Yavuz, Evan Randall Sparks, Shivaram Venkataraman, Davies Liu, Jeremy Freeman, D. B. Tsai, Manish Amde, Sean Owen, Doris Xin, Reynold Xin, Michael J. Franklin, Reza Zadeh, Matei Zaharia, Ameet Talwalkar:
MLlib: Machine Learning in Apache Spark. CoRR abs/1505.06807 (2015) - [i3]Xiao Li, Joseph K. Bradley, Sameer Pawar, Kannan Ramchandran:
SPRIGHT: A Fast and Robust Framework for Sparse Walsh-Hadamard Transform. CoRR abs/1508.06336 (2015) - 2014
- [c6]Xiao Li, Joseph Kurata Bradley, Sameer Pawar, Kannan Ramchandran:
The SPRIGHT algorithm for robust sparse Hadamard Transforms. ISIT 2014: 1857-1861 - [c5]Xinghao Pan, Stefanie Jegelka, Joseph E. Gonzalez, Joseph K. Bradley, Michael I. Jordan:
Parallel Double Greedy Submodular Maximization. NIPS 2014: 118-126 - [i2]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
When is it Better to Compare than to Score? CoRR abs/1406.6618 (2014) - 2013
- [b1]Joseph K. Bradley:
Learning Large-Scale Conditional Random Fields. Carnegie Mellon University, USA, 2013 - 2012
- [c4]Joseph K. Bradley, Carlos Guestrin:
Sample Complexity of Composite Likelihood. AISTATS 2012: 136-160 - 2011
- [c3]Joseph K. Bradley, Aapo Kyrola, Danny Bickson, Carlos Guestrin:
Parallel Coordinate Descent for L1-Regularized Loss Minimization. ICML 2011: 321-328 - [i1]Joseph K. Bradley, Aapo Kyrola, Danny Bickson, Carlos Guestrin:
Parallel Coordinate Descent for L1-Regularized Loss Minimization. CoRR abs/1105.5379 (2011) - 2010
- [c2]Joseph K. Bradley, Carlos Guestrin:
Learning Tree Conditional Random Fields. ICML 2010: 127-134
2000 – 2009
- 2007
- [c1]Joseph K. Bradley, Robert E. Schapire:
FilterBoost: Regression and Classification on Large Datasets. NIPS 2007: 185-192
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-09-13 01:41 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:
