default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBrian Dalessandro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[i1]Julie Moeyersoms, Brian Dalessandro, Foster J. Provost, David Martens:
Explaining Classification Models Built on High-Dimensional Sparse Data. CoRR abs/1607.06280 (2016)- 2015
- [j4]Brian Dalessandro, Rod Hook, Claudia Perlich, Foster J. Provost:
Evaluating and Optimizing Online Advertising: Forget the Click, but There Are Good Proxies. Big Data 3(2): 90-102 (2015) - 2014
- [j3]Brian Dalessandro, Claudia Perlich, Troy Raeder:
Bigger is Better, but at What Cost?Estimating the Economic Value of Incremental Data Assets. Big Data 2(2): 87-96 (2014) - [j2]Claudia Perlich, Brian Dalessandro, Troy Raeder, Ori Stitelman, Foster J. Provost:
Machine learning for targeted display advertising: transfer learning in action. Mach. Learn. 95(1): 103-127 (2014) - [c10]Melinda Han Williams, Claudia Perlich, Brian Dalessandro, Foster J. Provost:
Pleasing the advertising oracle: Probabilistic prediction from sampled, aggregated ground truth. ADKDD@KDD 2014: 3:1-3:9 - [c9]Brian Dalessandro, Daizhuo Chen, Troy Raeder, Claudia Perlich, Melinda Han Williams, Foster J. Provost:
Scalable hands-free transfer learning for online advertising. KDD 2014: 1573-1582 - 2013
- [j1]Brian Dalessandro:
Bring the Noise: Embracing Randomness Is the Key to Scaling Up Machine Learning Algorithms. Big Data 1(2): 110-112 (2013) - [c8]Martine De Cock
, Senjuti Basu Roy, Swapna Savvana, Vani Mandava, Brian Dalessandro, Claudia Perlich, William Cukierski, Benjamin Hamner:
The Microsoft Academic Search challenges at KDD Cup 2013. IEEE BigData 2013: 1-4 - [c7]Senjuti Basu Roy, Martine De Cock, Vani Mandava, Swapna Savanna, Brian Dalessandro, Claudia Perlich, William Cukierski, Ben Hamner:
The Microsoft academic search dataset and KDD Cup 2013. KDD Cup 2013: 1:1-1:6 - [c6]Troy Raeder, Claudia Perlich, Brian Dalessandro, Ori Stitelman, Foster J. Provost:
Scalable supervised dimensionality reduction using clustering. KDD 2013: 1213-1221 - [c5]Ori Stitelman, Claudia Perlich, Brian Dalessandro, Rod Hook, Troy Raeder, Foster J. Provost:
Using co-visitation networks for detecting large scale online display advertising exchange fraud. KDD 2013: 1240-1248 - 2012
- [c4]Brian Dalessandro, Claudia Perlich, Ori Stitelman, Foster J. Provost:
Causally motivated attribution for online advertising. AdKDD@KDD 2012: 7:1-7:9 - [c3]Claudia Perlich, Brian Dalessandro, Rod Hook, Ori Stitelman, Troy Raeder, Foster J. Provost:
Bid optimizing and inventory scoring in targeted online advertising. KDD 2012: 804-812 - [c2]Troy Raeder, Ori Stitelman, Brian Dalessandro, Claudia Perlich, Foster J. Provost:
Design principles of massive, robust prediction systems. KDD 2012: 1357-1365
2000 – 2009
- 2009
- [c1]Foster J. Provost, Brian Dalessandro, Rod Hook, Xiaohan Zhang, Alan Murray:
Audience selection for on-line brand advertising: privacy-friendly social network targeting. KDD 2009: 707-716
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-04-24 23:05 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:
