Special Libraries, March 1947

Volume 38, Issue 3https://scholarworks.sjsu.edu/sla_sl_1947/1002/thumbnail.jp

Interpretable Predictions of Tree-based Ensembles via Actionable Feature Tweaking

Machine-learned models are often described as "black boxes". In many real-world applications however, models may have to sacrifice predictive power in favour of human-interpretability. When this is the case, feature engineering becomes a crucial task, which requires significant and time-consuming human effort. Whilst some features are inherently static, representing properties that cannot be influenced (e.g., the age of an individual), others capture characteristics that could be adjusted (e.g., the daily amount of carbohydrates taken). Nonetheless, once a model is learned from the data, each prediction it makes on new instances is irreversible - assuming every instance to be a static point located in the chosen feature space. There are many circumstances however where it is important to understand (i) why a model outputs a certain prediction on a given instance, (ii) which adjustable features of that instance should be modified, and finally (iii) how to alter such a prediction when the mutated instance is input back to the model. In this paper, we present a technique that exploits the internals of a tree-based ensemble classifier to offer recommendations for transforming true negative instances into positively predicted ones. We demonstrate the validity of our approach using an online advertising application. First, we design a Random Forest classifier that effectively separates between two types of ads: low (negative) and high (positive) quality ads (instances). Then, we introduce an algorithm that provides recommendations that aim to transform a low quality ad (negative instance) into a high quality one (positive instance). Finally, we evaluate our approach on a subset of the active inventory of a large ad network, Yahoo Gemini.Comment: 10 pages, KDD 201

Special Libraries, February 1956

Volume 47, Issue 2https://scholarworks.sjsu.edu/sla_sl_1956/1001/thumbnail.jp

CHORUS Deliverable 3.4: Vision Document

The goal of the CHORUS Vision Document is to create a high level vision on audio-visual search engines in order to give guidance to the future R&D work in this area and to highlight trends and challenges in this domain. The vision of CHORUS is strongly connected to the CHORUS Roadmap Document (D2.3). A concise document integrating the outcomes of the two deliverables will be prepared for the end of the project (NEM Summit)

Inter Process Communication and Prioritization to Enable Desktop Advertisement Mechanism

This research paper tries to bring in a new concept of desktop advertising mechanism by synchronization it with the running processes and the data on users’ side. The proposed approach shall be based on inter process communication interaction, scheduling, prioritization, desktop crawling and system calls. The running process status and data will be fetched by the proposed process, which will then seek relevant information with the remote ad server and display the advertisements fetched based on keywords on user side

Measuring Digital Advertising Effectiveness: Solving the Count/Quality Dilemma

abstract: Total digital media advertising spending of $72.5 billion surpassed total television Ad spending of$71.3 billion for the first time ever in 2016. Approximately $39 billion, or 54% of the digital media advertising spend, involved pre-programmed software that purchased Ads on behalf of a buyer in Real-Time Bidding (RTB) settings. A major concern for Ad buyers is sub-optimal spending in RTB settings owing to biases in the attribution of customer conversions to Ad impressions. The purpose of this research is twofold. First, identify and propose a novel experimental design and analysis plan for to handling a previously unidentified and unaddressed source of endogeneity: count/quality simultaneity bias (CQB). Second, conduct a field study using data for Ad response rates, cost, and observed consumer behavior to solve for the profit maximizing daily Ad frequency per customer. One large online retailer provided data for Ad impressions, bid costs, response rates, revenue per visit, and operating costs for 153,561 unique users over 23 days. Unique visitors were randomly assigned to one of seven treatment groups with one, two, three, four, five, and six impressions per day limits as well as a final condition with no daily impression cap. Ordinary least square models (OLS) were fit to the data and a non-linear relationship between Ad impressions and site visits demonstrating declining marginal effect of Ad impression on site visits after an optimal point. The results of the field study confirmed the existence of negative CQB and demonstrated how my novel experimental design and analysis can reduce the negative bias in the estimate of impression quantity on customer response. Second, managers interested in improving the efficiency of advertising spend should restrict display advertising to only the highest quality inventory through specific site targeting and by leveraging direct buys and private marketplace deals. This strategy ensures that subsequent impressions are not of lower quality by restricting the pool of possible impressions from a homogenous set of high quality inventory.Dissertation/ThesisDoctoral Dissertation Business Administration 201

Special Libraries, October 1952

Volume 43, Issue 8https://scholarworks.sjsu.edu/sla_sl_1952/1007/thumbnail.jp

Special Libraries, January 1949

Volume 40, Issue 1https://scholarworks.sjsu.edu/sla_sl_1949/1000/thumbnail.jp