In this presentation I will talk about the design of scalable recommender systems and its similarity with advertising systems. The problem of generating and delivering recommendations of content/products to appropriate audiences and ultimately to individual users at scale is largely similar to the matching problem in computational advertising, specially in the context of dealing with self and cross promotional content. In this analogy with online advertising a display opportunity triggers a recommendation. The actors are the publisher (website/medium/app owner) the advertiser (content owner or promoter), whereas the ads or creatives represent the items being recommended that compete for the display opportunity and may have different monetary value to the actors. To effectively control what is recommended to whom, targeting constraints need to be defined over an attribute space, typically grouped by type (Audience, Content, Context, etc.) where some associated values are not known until decisioning time. In addition to constraints, there are business objectives (e.g. delivery quota) defined by the actors. Both constraints and objectives can be encapsulated into and expressed as campaigns. Finally, there there is the concept of relevance, directly related to users' response prediction that is computed using the same attribute space used as signals.
As in advertising, recommendation systems require a serving platform where decisioning happens in real-time (few milliseconds) typically selecting an optimal set of items to display to the user from hundreds, sometimes thousands or millions of items. User actions are then taken as feedback and used to learn models that dynamically adjust order to meet business objectives.
This is a radical departure from the traditional item-based and user-based collaborative filtering approach to recommender systems, which fails to factor-in context, such as time-of-day, geo-location or category of the surrounding content to generate more accurate recommendations. Traditional approaches also fail to recognize that recommendations don't happen in a vacuum and as such may require the evaluation of business constraints and objectives. All this should be considered when designing and developing true commercial recommender/advertising systems.
Speaker Bio
Joaquin A. Delgado is currently Director of Advertising Technology at Intel Media (a wholly owned subsidiary of Intel Corp.), working on disruptive technologies in the Internet T.V. space. Previous to that he held CTO positions at AdBrite, Lending Club and TripleHop Technologies (acquired by Oracle). He was also Director of Engineering and Sr. Architect Principal at Yahoo! His expertise lies on distributed systems, advertising technology, machine learning, recommender systems and search. He holds a Ph.D in computer science and artificial intelligence from Nagoya Institute of Technology, Japan.
Modern Perspectives on Recommender Systems and their Applications in MendeleyKris Jack
Presentation given for one of Pearson's Data Research teams. It motivates the use of recommender systems, describes common approaches to building and evaluating them and gives examples of how they are used in Mendeley. Thanks to Maya Hristakeva for creating some of the slides.
Recommenders Systems tutorial slides from the European Summer School of Information Retrieval (ESSIR).
Covers basic ideas on Collaborative Filtering, Content-based methods, Matrix Factorization, Restricted Boltzmann Machines, Ranking, Diversity.
The slides include material from Xavier Amatriain, Saul Vargas and Linas Baltrunas.
In this presentation I will talk about the design of scalable recommender systems and its similarity with advertising systems. The problem of generating and delivering recommendations of content/products to appropriate audiences and ultimately to individual users at scale is largely similar to the matching problem in computational advertising, specially in the context of dealing with self and cross promotional content. In this analogy with online advertising a display opportunity triggers a recommendation. The actors are the publisher (website/medium/app owner) the advertiser (content owner or promoter), whereas the ads or creatives represent the items being recommended that compete for the display opportunity and may have different monetary value to the actors. To effectively control what is recommended to whom, targeting constraints need to be defined over an attribute space, typically grouped by type (Audience, Content, Context, etc.) where some associated values are not known until decisioning time. In addition to constraints, there are business objectives (e.g. delivery quota) defined by the actors. Both constraints and objectives can be encapsulated into and expressed as campaigns. Finally, there there is the concept of relevance, directly related to users' response prediction that is computed using the same attribute space used as signals.
As in advertising, recommendation systems require a serving platform where decisioning happens in real-time (few milliseconds) typically selecting an optimal set of items to display to the user from hundreds, sometimes thousands or millions of items. User actions are then taken as feedback and used to learn models that dynamically adjust order to meet business objectives.
This is a radical departure from the traditional item-based and user-based collaborative filtering approach to recommender systems, which fails to factor-in context, such as time-of-day, geo-location or category of the surrounding content to generate more accurate recommendations. Traditional approaches also fail to recognize that recommendations don't happen in a vacuum and as such may require the evaluation of business constraints and objectives. All this should be considered when designing and developing true commercial recommender/advertising systems.
Speaker Bio
Joaquin A. Delgado is currently Director of Advertising Technology at Intel Media (a wholly owned subsidiary of Intel Corp.), working on disruptive technologies in the Internet T.V. space. Previous to that he held CTO positions at AdBrite, Lending Club and TripleHop Technologies (acquired by Oracle). He was also Director of Engineering and Sr. Architect Principal at Yahoo! His expertise lies on distributed systems, advertising technology, machine learning, recommender systems and search. He holds a Ph.D in computer science and artificial intelligence from Nagoya Institute of Technology, Japan.
Modern Perspectives on Recommender Systems and their Applications in MendeleyKris Jack
Presentation given for one of Pearson's Data Research teams. It motivates the use of recommender systems, describes common approaches to building and evaluating them and gives examples of how they are used in Mendeley. Thanks to Maya Hristakeva for creating some of the slides.
Recommenders Systems tutorial slides from the European Summer School of Information Retrieval (ESSIR).
Covers basic ideas on Collaborative Filtering, Content-based methods, Matrix Factorization, Restricted Boltzmann Machines, Ranking, Diversity.
The slides include material from Xavier Amatriain, Saul Vargas and Linas Baltrunas.
The slides from the Machine Learning Summers School 2015 in Sydney on Machine Learning for Recommender Systems. Collaborative filtering algorithms, Context-aware methods, Restricted Boltzmann Machines, Recurrent Neural Networks, Tensor Factorization, etc.
In this lecture, I will first cover the recent advances in neural recommender systems such as autoencoder-based and MLP-based recommender systems. Then, I will introduce the recent achievement for automatic playlist continuation in music recommendation.
This is part 1 of the tutorial Xavier and Deepak gave at Recsys 2016 this year. You can find the second part http://www.slideshare.net/xamat/recsys-2016-tutorial-lessons-learned-from-building-reallife-recommender-systems
Mendeley’s Research Catalogue: building it, opening it up and making it even ...Kris Jack
Presentation given at Workshop on Academic-Industrial Collaborations for Recommender Systems 2013 (http://bit.ly/114XDsE), JCDL'13. A walk through Mendeley as a platform, growing pains involved with engineering at a large scale, the data that we're making publicly available and some demos that have come out of academic collaborations.
Product Recommendations Enhanced with Reviewsmaranlar
Tutorial presented by Muthusamy Chelliah (Flipkart, India) and Sudeshna Sarkar (IIT Kharagpur, India) at ACM RecSys 2017 https://recsys.acm.org/recsys17/tutorials/#content-tab-1-3-tab
E-commerce websites commonly deploy recommender systems that make use of user activity (e.g., ratings, views, and purchases) or content (product descriptions). These recommender systems can benefit enormously by also exploiting the information contained in customer reviews. Reviews capture the experience of multiple customers with diverse preferences, often on the fine-grained level of specific features of products. Reviews can also identify consumers’ preferences for product features and provide helpful explanations. The usefulness of reviews is evidenced by the prevalence of their use by customers to support shopping decisions online. With the appropriate techniques, recommender systems can benefit directly from user reviews.
This tutorial will present a range of techniques that allow recommender systems in e-commerce websites to take full advantage of reviews. Topics covered include text mining methods for feature-specific sentiment analysis of products, topic models and distributed representations that bridge the vocabulary gap between user reviews and product descriptions, and recommender algorithms that use review information to address the cold-start problem.
The tutorial sessions will be interspersed with examples from an online marketplace (i.e., Flipkart) and experience with using data mining and Natural Language Processing techniques (e.g., matrix factorization, LDA, word embeddings) from Web-scale systems.
Overview of the Recommender system or recommendation system. RFM Concepts in brief. Collaborative Filtering in Item and User based. Content-based Recommendation also described.Product Association Recommender System. Stereotype Recommendation described with advantage and limitations.Customer Lifetime. Recommender System Analysis and Solving Cycle.
Recsys 2016 - Accuracy and Diversity in Cross-domain Recommendations for Cold...Paolo Tomeo
Paper presentation at the 2016 ACM Recommender Systems conference in Boston (MIT).
Computing useful recommendations for cold-start users is a major challenge in the design of recommender systems, and additional data is often required to compensate the scarcity of user feedback. In this paper we address such problem in a target domain by exploiting user preferences from a related auxiliary domain. Following a rigorous methodology for cold-start, we evaluate a number of recommendation methods on a dataset with positive-only feedback in the movie and music domains, both in single and cross-domain scenarios. Comparing the methods in terms of item ranking accuracy, diversity and catalog coverage, we show that cross-domain preference data is useful to provide more accurate suggestions when user feedback in the target domain is scarce or not available at all, and may lead to more diverse recommendations depending on the target domain. Moreover, evaluating the impact of the user profile size and diversity in the source domain, we show that, in general, the quality of target recommendations increases with the size of the profile, but may deteriorate with too diverse profiles.
The slides from the Machine Learning Summers School 2015 in Sydney on Machine Learning for Recommender Systems. Collaborative filtering algorithms, Context-aware methods, Restricted Boltzmann Machines, Recurrent Neural Networks, Tensor Factorization, etc.
In this lecture, I will first cover the recent advances in neural recommender systems such as autoencoder-based and MLP-based recommender systems. Then, I will introduce the recent achievement for automatic playlist continuation in music recommendation.
This is part 1 of the tutorial Xavier and Deepak gave at Recsys 2016 this year. You can find the second part http://www.slideshare.net/xamat/recsys-2016-tutorial-lessons-learned-from-building-reallife-recommender-systems
Mendeley’s Research Catalogue: building it, opening it up and making it even ...Kris Jack
Presentation given at Workshop on Academic-Industrial Collaborations for Recommender Systems 2013 (http://bit.ly/114XDsE), JCDL'13. A walk through Mendeley as a platform, growing pains involved with engineering at a large scale, the data that we're making publicly available and some demos that have come out of academic collaborations.
Product Recommendations Enhanced with Reviewsmaranlar
Tutorial presented by Muthusamy Chelliah (Flipkart, India) and Sudeshna Sarkar (IIT Kharagpur, India) at ACM RecSys 2017 https://recsys.acm.org/recsys17/tutorials/#content-tab-1-3-tab
E-commerce websites commonly deploy recommender systems that make use of user activity (e.g., ratings, views, and purchases) or content (product descriptions). These recommender systems can benefit enormously by also exploiting the information contained in customer reviews. Reviews capture the experience of multiple customers with diverse preferences, often on the fine-grained level of specific features of products. Reviews can also identify consumers’ preferences for product features and provide helpful explanations. The usefulness of reviews is evidenced by the prevalence of their use by customers to support shopping decisions online. With the appropriate techniques, recommender systems can benefit directly from user reviews.
This tutorial will present a range of techniques that allow recommender systems in e-commerce websites to take full advantage of reviews. Topics covered include text mining methods for feature-specific sentiment analysis of products, topic models and distributed representations that bridge the vocabulary gap between user reviews and product descriptions, and recommender algorithms that use review information to address the cold-start problem.
The tutorial sessions will be interspersed with examples from an online marketplace (i.e., Flipkart) and experience with using data mining and Natural Language Processing techniques (e.g., matrix factorization, LDA, word embeddings) from Web-scale systems.
Overview of the Recommender system or recommendation system. RFM Concepts in brief. Collaborative Filtering in Item and User based. Content-based Recommendation also described.Product Association Recommender System. Stereotype Recommendation described with advantage and limitations.Customer Lifetime. Recommender System Analysis and Solving Cycle.
Recsys 2016 - Accuracy and Diversity in Cross-domain Recommendations for Cold...Paolo Tomeo
Paper presentation at the 2016 ACM Recommender Systems conference in Boston (MIT).
Computing useful recommendations for cold-start users is a major challenge in the design of recommender systems, and additional data is often required to compensate the scarcity of user feedback. In this paper we address such problem in a target domain by exploiting user preferences from a related auxiliary domain. Following a rigorous methodology for cold-start, we evaluate a number of recommendation methods on a dataset with positive-only feedback in the movie and music domains, both in single and cross-domain scenarios. Comparing the methods in terms of item ranking accuracy, diversity and catalog coverage, we show that cross-domain preference data is useful to provide more accurate suggestions when user feedback in the target domain is scarce or not available at all, and may lead to more diverse recommendations depending on the target domain. Moreover, evaluating the impact of the user profile size and diversity in the source domain, we show that, in general, the quality of target recommendations increases with the size of the profile, but may deteriorate with too diverse profiles.
Smart Canvas @ Large Scale Recommender Systems Workshop 2015Gilmar Souza
These are the slides that myself and Gabriel Moreira (https://br.linkedin.com/in/gabrielspmoreira) used to present the Smart Canvas (www.ciandt.com/smartcanvas) at the Large-Scale Recommender Systems Workshop (https://dato.com/events/lsrs15.html) in Vienna, Austria on September 20th 2015.
This tutorial gives an overview of how search engines and machine learning techniques can be tightly coupled to address the need for building scalable recommender or other prediction based systems. Typically, most of them architect retrieval and prediction in two phases. In Phase I, a search engine returns the top-k results based on constraints expressed as a query. In Phase II, the top-k results are re-ranked in another system according to an optimization function that uses a supervised trained model. However this approach presents several issues, such as the possibility of returning sub-optimal results due to the top-k limits during query, as well as the prescence of some inefficiencies in the system due to the decoupling of retrieval and ranking.
To address this issue the authors created ML-Scoring, an open source framework that tightly integrates machine learning models into Elasticsearch, a popular search engine. ML-Scoring replaces the default information retrieval ranking function with a custom supervised model that is trained through Spark, Weka, or R that is loaded as a plugin in Elasticsearch. This tutorial will not only review basic methods in information retrieval and machine learning, but it will also walk through practical examples from loading a dataset into Elasticsearch to training a model in Spark, Weka, or R, to creating the ML-Scoring plugin for Elasticsearch. No prior experience is required in any system listed (Elasticsearch, Spark, Weka, R), though some programming experience is recommended.
Recommender System at Scale Using HBase and HadoopDataWorks Summit
Recommender Systems play a crucial role in a variety of businesses in today`s world. From E-Commerce web sites to News Portals, companies are leveraging data about their users to create a personalizes user experience, gain competitive advantage and eventually drive revenue. Dealing with the sheer quantity of data readily available can be a daunting task by itself. Consider applying machine learning algorithms on top of it and it makes the problem exponentially complex. Fortunately, tools like Hadoop and HBase make this task a little more manageable by taking out some of the complexities of dealing with a large amount of data. In this talk, we will share our success story of building a recommender system for Bloomberg.com leveraging the Hadoop ecosystem. We will describe the high level architecture of the system and discuss the pros and cons of our design choices. Bloomberg.com operates at a scale of 100s of millions of users. Building a recommendation engine for Bloomberg.com entails applying Machine Learning algorithms on terabytes of data and still being able to serve sub-second responses. We will discuss techniques for efficiently and reliably collecting data in near real-time, the notion of offline vs. online processing and most importantly, how HBase perfectly fits the bill by serving as a real-time database as well as input/output for running MapReduce.
Deep learning: the future of recommendationsBalázs Hidasi
An informative talk about deep learning and its potential uses in recommender systems. Presented at the Budapest Startup Safary, 21 April, 2016.
The breakthroughs of the last decade in neural network research and the quick increasing of computational power resulted in the revival of deep neural networks and the field focusing on their training: deep learning. Deep learning methods have succeeded in complex tasks where other machine learning methods have failed, such as computer vision and natural language processing. Recently deep learning has began to gain ground in recommender systems as well. This talk introduces deep learning and its applications, with emphasis on how deep learning methods can solve long standing recommendation problems.
Deep learning continues to push the state of the art in domains such as computer vision, natural language understanding and recommendation engines. One of the key reasons for this progress is the availability of highly flexible and developer friendly deep learning frameworks. During this workshop, members of the Amazon Machine Learning team will provide a short background on Deep Learning focusing on relevant application domains and an introduction to using the powerful and scalable Deep Learning framework, MXNet. At the end of this tutorial you’ll gain hands on experience targeting a variety of applications including computer vision and recommendation engines as well as exposure to how to use preconfigured Deep Learning AMIs and CloudFormation Templates to help speed your development.
Recommendations are everywhere : music, movies, books, social medias, e-commerce web sites… The Web is leaving the era of search and entering one of discovery. This quick introduction will help you to understand this vast topic and why you should use it.
leewayhertz.com-How to build an AI-powered recommendation system.pdfrobertsamuel23
The internet has transformed the way we shop, with a vast selection of products available
for purchase online. However, this convenience comes at a cost, with consumers having to
sort through countless options, making it an overwhelming and tiring task.
case based recommendation approach for market basket datamniranjanmurthy
Recommender systems have become an important part of various applications in e-commerce, supporting both customers and providers in their decision-making processes. However, these systems still must overcome limitations that reduce their performance, like recommendations overspecialization, less popular item providing, and difficulties when items with unequal probability distribution appear or recommendations for sets of items are asked. A novel approach, addressing the above issues through a case-based recommendation methodology is presented here. The scope of the presented approach is to generate meaningful recommendations based on items' co-occurring patterns and to provide more insight into customers' buying habits. In contrast to current recommendation techniques that recommend items based on users' ratings or history, and to most case-based item recommenders that evaluate items' similarities, the implemented recommender uses a hierarchical model for the items and searches for similar sets of items, in order to recommend those that are most likely to satisfy a user.
Presentation on best practices for enterprise search by BlueBolt. The presentation provides reasons why enterprise search is needed with statistics to back it up, then walks through multiple examples and case studies showing off what good search looks like.
with current projections regarding the growth of
Internet sales, online retailing raises many questions about how
to market on the Net. A Recommender System (RS) is a
composition of software tools that provides valuable piece of
advice for items or services chosen by a user. Recommender
systems are currently useful in both the research and in the
commercial areas. Recommender systems are a means of
personalizing a site and a solution to the customer’s information
overload problem. Recommender Systems (RS) are software
tools and techniques providing suggestions for items and/or
services to be of use to a user. These systems are achieving
widespread success in ecommerce applications now a days, with
the advent of internet. This paper presents a categorical review
of the field of recommender systems and describes the state-ofthe-
art of the recommendation methods that are usually
classified into four categories: Content based Collaborative,
Demographic and Hybrid systems. To build our recommender
system we will use fuzzy logic and Markov chain algorithm.
What IA, UX and SEO Can Learn from Each OtherIan Lurie
Google has become the arbiter how users experience a website. Their data-driven determinants of what constitute good UX directly influence how a site is found. This is wrong because people, not machines, should determine experience; Google does not tell the SEO or UX community what data is used to measure experience and many elements of experience cannot be measured.This presentation reveals why Google uses UX signals to determine placement in search results and how to create a customer pleasing and highly visible user experience for your website.
Here's a next step to understanding Recommendation Engine in AI.
Collaborative filtering
Want to know how it works?
How can it help you skyrocket your company sales?
checkout our website to know more! http://bit.ly/2nYcPB1
Develop a robust and effective book recommendation system that provides personalized suggestions to users, enhancing their reading experience and promoting diverse literary exploration.
Search Analytics For Content Strategists @CSofNYCWIKOLO
Search is a conversation, learn to listen to what you visitors are telling you by understanding their search behavior. In this presentation we'll cover information foraging, search analysis, and how to use them and other techniques to improve your content without having to be a statistician.
A user centred approach to building content - charlie williamsCharlie Williams
A webinar for SEMRush where I take a look at some of my thoughts on research content that is user-centric.
The aim is to create great content that plays to Google's semantic search capabilities, and drives loads of new keyword research opportunities.
Recommendation systems, also known as recommendation engines, are a type of information system whose purpose is to suggest, or recommend items or actions to users.
The recommendations may consist of:
-> retail items (movies, books, etc.) or
-> actions, such as following other users in a social network.
It can be said that, Recommendation engines are nothing but an automated form of a “shop counter guy”. You ask him for a product. Not only he shows that product, but also the related ones which you could buy. They are well trained in cross selling and up selling. So, does our recommendation engines.
Recommender systems are viewed as prediction problems in which the user profiles and their rated target items reflect the degree of the user's preference for that item. Recommender Systems should account for temporal effects, reflecting the dynamic, time-drifting nature of user-item interactions. Averages should be avoided as they lack context. Good recommendations will take context and product associations into account when making recommendations
Similar to Introduction and new trends in Recommender Systems (20)
Enhanced Enterprise Intelligence with your personal AI Data Copilot.pdfGetInData
Recently we have observed the rise of open-source Large Language Models (LLMs) that are community-driven or developed by the AI market leaders, such as Meta (Llama3), Databricks (DBRX) and Snowflake (Arctic). On the other hand, there is a growth in interest in specialized, carefully fine-tuned yet relatively small models that can efficiently assist programmers in day-to-day tasks. Finally, Retrieval-Augmented Generation (RAG) architectures have gained a lot of traction as the preferred approach for LLMs context and prompt augmentation for building conversational SQL data copilots, code copilots and chatbots.
In this presentation, we will show how we built upon these three concepts a robust Data Copilot that can help to democratize access to company data assets and boost performance of everyone working with data platforms.
Why do we need yet another (open-source ) Copilot?
How can we build one?
Architecture and evaluation
Global Situational Awareness of A.I. and where its headedvikram sood
You can see the future first in San Francisco.
Over the past year, the talk of the town has shifted from $10 billion compute clusters to $100 billion clusters to trillion-dollar clusters. Every six months another zero is added to the boardroom plans. Behind the scenes, there’s a fierce scramble to secure every power contract still available for the rest of the decade, every voltage transformer that can possibly be procured. American big business is gearing up to pour trillions of dollars into a long-unseen mobilization of American industrial might. By the end of the decade, American electricity production will have grown tens of percent; from the shale fields of Pennsylvania to the solar farms of Nevada, hundreds of millions of GPUs will hum.
The AGI race has begun. We are building machines that can think and reason. By 2025/26, these machines will outpace college graduates. By the end of the decade, they will be smarter than you or I; we will have superintelligence, in the true sense of the word. Along the way, national security forces not seen in half a century will be un-leashed, and before long, The Project will be on. If we’re lucky, we’ll be in an all-out race with the CCP; if we’re unlucky, an all-out war.
Everyone is now talking about AI, but few have the faintest glimmer of what is about to hit them. Nvidia analysts still think 2024 might be close to the peak. Mainstream pundits are stuck on the wilful blindness of “it’s just predicting the next word”. They see only hype and business-as-usual; at most they entertain another internet-scale technological change.
Before long, the world will wake up. But right now, there are perhaps a few hundred people, most of them in San Francisco and the AI labs, that have situational awareness. Through whatever peculiar forces of fate, I have found myself amongst them. A few years ago, these people were derided as crazy—but they trusted the trendlines, which allowed them to correctly predict the AI advances of the past few years. Whether these people are also right about the next few years remains to be seen. But these are very smart people—the smartest people I have ever met—and they are the ones building this technology. Perhaps they will be an odd footnote in history, or perhaps they will go down in history like Szilard and Oppenheimer and Teller. If they are seeing the future even close to correctly, we are in for a wild ride.
Let me tell you what we see.
Adjusting primitives for graph : SHORT REPORT / NOTESSubhajit Sahu
Graph algorithms, like PageRank Compressed Sparse Row (CSR) is an adjacency-list based graph representation that is
Multiply with different modes (map)
1. Performance of sequential execution based vs OpenMP based vector multiply.
2. Comparing various launch configs for CUDA based vector multiply.
Sum with different storage types (reduce)
1. Performance of vector element sum using float vs bfloat16 as the storage type.
Sum with different modes (reduce)
1. Performance of sequential execution based vs OpenMP based vector element sum.
2. Performance of memcpy vs in-place based CUDA based vector element sum.
3. Comparing various launch configs for CUDA based vector element sum (memcpy).
4. Comparing various launch configs for CUDA based vector element sum (in-place).
Sum with in-place strategies of CUDA mode (reduce)
1. Comparing various launch configs for CUDA based vector element sum (in-place).
Techniques to optimize the pagerank algorithm usually fall in two categories. One is to try reducing the work per iteration, and the other is to try reducing the number of iterations. These goals are often at odds with one another. Skipping computation on vertices which have already converged has the potential to save iteration time. Skipping in-identical vertices, with the same in-links, helps reduce duplicate computations and thus could help reduce iteration time. Road networks often have chains which can be short-circuited before pagerank computation to improve performance. Final ranks of chain nodes can be easily calculated. This could reduce both the iteration time, and the number of iterations. If a graph has no dangling nodes, pagerank of each strongly connected component can be computed in topological order. This could help reduce the iteration time, no. of iterations, and also enable multi-iteration concurrency in pagerank computation. The combination of all of the above methods is the STICD algorithm. [sticd] For dynamic graphs, unchanged components whose ranks are unaffected can be skipped altogether.
Analysis insight about a Flyball dog competition team's performanceroli9797
Insight of my analysis about a Flyball dog competition team's last year performance. Find more: https://github.com/rolandnagy-ds/flyball_race_analysis/tree/main
The Building Blocks of QuestDB, a Time Series Databasejavier ramirez
Talk Delivered at Valencia Codes Meetup 2024-06.
Traditionally, databases have treated timestamps just as another data type. However, when performing real-time analytics, timestamps should be first class citizens and we need rich time semantics to get the most out of our data. We also need to deal with ever growing datasets while keeping performant, which is as fun as it sounds.
It is no wonder time-series databases are now more popular than ever before. Join me in this session to learn about the internal architecture and building blocks of QuestDB, an open source time-series database designed for speed. We will also review a history of some of the changes we have gone over the past two years to deal with late and unordered data, non-blocking writes, read-replicas, or faster batch ingestion.
Chatty Kathy - UNC Bootcamp Final Project Presentation - Final Version - 5.23...John Andrews
SlideShare Description for "Chatty Kathy - UNC Bootcamp Final Project Presentation"
Title: Chatty Kathy: Enhancing Physical Activity Among Older Adults
Description:
Discover how Chatty Kathy, an innovative project developed at the UNC Bootcamp, aims to tackle the challenge of low physical activity among older adults. Our AI-driven solution uses peer interaction to boost and sustain exercise levels, significantly improving health outcomes. This presentation covers our problem statement, the rationale behind Chatty Kathy, synthetic data and persona creation, model performance metrics, a visual demonstration of the project, and potential future developments. Join us for an insightful Q&A session to explore the potential of this groundbreaking project.
Project Team: Jay Requarth, Jana Avery, John Andrews, Dr. Dick Davis II, Nee Buntoum, Nam Yeongjin & Mat Nicholas
ViewShift: Hassle-free Dynamic Policy Enforcement for Every Data LakeWalaa Eldin Moustafa
Dynamic policy enforcement is becoming an increasingly important topic in today’s world where data privacy and compliance is a top priority for companies, individuals, and regulators alike. In these slides, we discuss how LinkedIn implements a powerful dynamic policy enforcement engine, called ViewShift, and integrates it within its data lake. We show the query engine architecture and how catalog implementations can automatically route table resolutions to compliance-enforcing SQL views. Such views have a set of very interesting properties: (1) They are auto-generated from declarative data annotations. (2) They respect user-level consent and preferences (3) They are context-aware, encoding a different set of transformations for different use cases (4) They are portable; while the SQL logic is only implemented in one SQL dialect, it is accessible in all engines.
#SQL #Views #Privacy #Compliance #DataLake
STATATHON: Unleashing the Power of Statistics in a 48-Hour Knowledge Extravag...sameer shah
"Join us for STATATHON, a dynamic 2-day event dedicated to exploring statistical knowledge and its real-world applications. From theory to practice, participants engage in intensive learning sessions, workshops, and challenges, fostering a deeper understanding of statistical methodologies and their significance in various fields."
12. Suggerisce all'utente item simili a quelli che ha apprezzato in
passato
Approaches
Content Based filtering
Collaborative filtering
Hybrid approaches
13. Suggerisce item apprezzati da altri utenti che hanno
preferenze simili
Content based filtering
Recommendations based on items similar to the ones
that the user liked in the past
Strengths
user independence
explainability
useful for cold-start
Drawbacks
sensitive to bad or incomplete information
over-specialization
less novelty and discovery
14. Suggerisce item apprezzati da altri utenti che hanno
preferenze simili
Collaborative filtering
Recommendations based on items that other users
with similar tastes liked in the past
Strengths
independent from the content
typically more accurate
can promote discovery
Drawbacks
sensitive to the quantity of users and feedbacks
difficult to recommend new item (cold-start item)
can reinforce item popularity
16. Hybrid approaches
Combination of content-based and collaborative filtering
methods
Ensemble of different methods
Graph-based methods applied on heterogeneous networks
Feature combination -> (Matrix Factorization with side
information, Factorization Machines, Neural Networks, …)
18. Offline evaluation
1 - Choose a dataset
2 - Split feedbacks for each user in train,
validation and test sets
3 - Train the systems with the evaluation set
4 - Produce the recommendations
5 - Evaluate on the test set
19. Some Libraries
RankSys - Java 8 Recommender Systems framework
for novelty, diversity and much more
https://github.com/RankSys/RankSys
Rival - Java toolkit for recommender system evaluation
https://github.com/recommenders/rival
GraphLab Create - Python machine learning framework
https://turi.com/products/create
20. (Some) New trends
Deep learning
Wide and deep learning
Multi-criteria
Graph-based algorithms
Use of Semantic Web
22. Wide and deep learning
https://research.googleblog.com/2016/06/wide-deep-learning-better-together-with.html
https://www.tensorflow.org/versions/r0.11/tutorials/wide_and_deep/index.html