SlideShare a Scribd company logo
1 of 14
RECOMMENDER ALGORITHM FOR BIPARTITE
NETWORKS USING ASSOCIATION RULES TO DISCOVER
CHARACTERISTICS INTRINSIC TO THE CONTENT
By
Eng. (Dr) Asoka Korale, C.Eng., MIESL
Eng. Nilanka Weeraman, AMIESL
BUSINESS CASE FOR MOBILE RING BACK TONE RECOMMENDER SYSTEM
Slide | 2
• Intense Competition and Low Margins in Traditional Mobile Service Applications
 Require Automated System of Reference
 Promote High Value Ring Back Tone Content
 Customer mostly unaware of available choice
 Huge Opportunity - Vast Choice - 10,000 songs
• Exploit Novelty and Attractive power of Value Added Services (VAS) portfolio
• Wide variation in Customer Preferences and Tastes
But
 Match Customer tastes with available content
 Develop new Revenue Streams
• Wide variation in the “Type” &“Intrinsic” properties of content (Themes, Concepts, Genres…)
NOVEL CONTRIBUTIONS OF THE RECOMMENDER ALGORITHM
Slide | 3
• Characterize Content utilizing items of Content itself
• Consumer Taste and Preference matched via “intrinsic” properties of the content
• Fast Association Rule generation Algorithm satisfying a-priori constraints on performance measures
• Recommendation uses Individual’s “Taste” and preferences of “Nearest Neighbors in Taste”
 Neighbors from single mode form of Consumer Vs. Content Bi-Partite Network
 Rules at each stage generated via Rules from previous stage that met Performance criteria
A B
&
D&
CA B
& CA B
 Recommendation independent of “meta data”
 A song is itself a “category” of song – representing a larger set of songs
NOVEL ASSOCIATION RULE ALGORITHM
Slide | 4
Customer Vs. Song Choice Incidence Matrix
Song Subscription
Customer A B C D
Cx1 1 0 1 1
Cx2 0 0 1 1
.. .. .. .. ..
… .. … … …
Cxm
Total NA NB NC ND
Test support for all pairs 4C2 = 6 combinations
{A,B}, {A,C}, {A,D}, {B,C}, {B,D}, {C,D}
Stage 1
Let NA, NB, NC & ND exceed the minimum support criteria
Initial Stage – Test Support of all Individual Items
Stage 2
 Support for any combination of items (songs) can be
found by the “ sum of the element by element
product“ of the respective columns
STOP when a certain Rule depth “N” reached Or when all Rule
combinations are created subject to the minimum support criteria
Stage 3
Test Support for combinations with new consequent terms
taken from set that satisfy minimum support criteria
Test: A&B->C, A&B->D, A&C->B, A&C->D, C&D->A , C&D->B
Stage 2 Rules: A&B->C
Merge Antecedent and Consequent terms of Rules in Stage 1
& CA B
……………..
……………..
Merge Antecedent and Consequent terms of Rules in Stage 2
D&& CA B
Create Rules only for pairs that meet min support criteria
Assume {A,B}, {A,C}, {B,C}, {C,D} meet criteria
Stage 1 Rules: A->B, A->C, B->C, C->D
A B
 Example: Under the right conditions the
rules may take the form
RECOMMENDER ALGORITHM – NEAREST NEIGHBOR SET DETERMINATION
Slide | 5
Song Subscription
Customer A B C D E F G H
Cx1 1 0 1 1 0 1 0 1
Cx2 0 0 1 1 1 0 0 1
Cx3 1 0 0 0 0 0 1 0
Cx4 1 0 1 0 0 0 1 0
… .. … … … … … … …
1. Determine all “Cxi” that share at least one item in
common with Target Customer Cx1
2. size of subscribed song set of each Cxi = nsiT
3. For each Cxi determine number of songs in
common “nsci” with target customer Cx1
4. The neighbour set: is set that meet apriori limits
on “nsiT” and “nsci”
5. The limits can be set on the basis of the size of
the subscription set of the target subscriber Cx1
6. a neighbour of the target subscriber is one
• who is within (+/-) 50% the size of the
subscription set of Cx1 and
• who also matches between (+/-) 30% of the
songs in the subscription set of Cx1
7. The neighbour item set : union of the set of items
among the subscribers who meet conditions in 6
Customer vs. Song Incidence Matrix
Customer vs. Customer Single Mode Network
Cx1
Cx2
Cx3
Cx4
2
2
3
1
1
A,G
A,C,G
A,C,D,F,H
C,D,E,H
Target
Customer
Cx2, Cx3, Cx4 are “Nearest Neighbors” in “Taste”
Confidence(A->B) =
Support(AUB)/Support(A)
=P(EA&EB)/P(EA)
= P(EB/EA)
Where P(EX) is the probability of
item X being bought in a
particular transaction
Select all Rules R1 = {r1,r2,…,rj,…,rK} with
Subscription Song set {S} as Antecedent
r1: s1->sj
r2: s1->sk
r3: s2->si
r4: s3->sm (j,k,i.m intergers)
Filter to Find Rule(s) with highest Confidence
Rmax: Max( Confidence(ri) ) ∀i
Available Song Set {AS} = Consequent Songs of
Rule Set Rmax
Determine Neighbor Song Set
{NS}
Intersection of Neighbor and
Available Song sets
IS = {AS∩NS}
Recommended Set RS = {IS}
Recommended Set RS = {AS}
Target Customer’s (Cx1)
Subscription Song Set
S = {s1,s2,…,si,…,sN}
Support (A->B)= N(AUB)/N
If |IS| > Limit
Y
N
Target Customer Song subscription
A, C, D, F, H
Neighbors @
min weight = 2
A
C
D
E
G
H
RECOMMENDER ALGORITHM -
Slide | 6
Rules for Cx1 Confidence
A->B 0.8
A->D 0.5
A->C 0.6
C->B 0.5
C->H 0.6
D->E 0.4
F->G 0.5
H->K 0.4
Filtered Rules Confidence
A->B 0.8
C->H 0.6
D->E 0.4
F->G 0.5
H->K 0.4
Available Song Set
B
H
E
G
K
IS E, G, H
RS B, E, G, H, K
RS E, G, H
RESULTS – INSIGHTS INTO CONSUMER BEHAVIOR THROUGH CHOICE OF SONGS
Slide | 7
Emotions it stirs
Personality is more or less fixed in adults
Ring Back Tone Song Preferences based on Psychographic
considerations
Preference for Music Types and Personality are related
Song tastes “related to personality” would also be
more or less fixed
Ring Back Tone a deeply Personal Choice & an outward
Representation of the Consumer
Images that come to
mind
Feelings it inspires
Carries deeper meaning to consumer not
observed in “meta data”
ATTRIBUTES INFLUENCING SONG SELECTION
Slide | 8
Dimensions of Consumer Appeal
Source
Novelty Criteria
Release
Themes
Language
love sorrow family
Music Charts
Teledrama
Films
New Old
Sinhala English
Tamil Hindi
Instrumental
parents religion national
cricket
Events
RESULTS
Slide | 9
Sub No Subscription Song Set of Subscriber Language Source Release Theme1 Theme2 Theme3
2 Athi Mawa Rawatuwa Sinhala Charts New Love Sorrow Losing
2 Kandulu Hollala Sinhala Charts New Love Sorrow Losing
2 Sithama Ridawa Sinhala Charts New Love Sorrow Losing
3 Wen Weela Giyada Sinhala Charts New Love Sorrow Losing
4 Nidi Warapu As Walin Sinhala Charts New Love Sorrow Losing
4 Obath Giya Sinhala Charts New Love Sorrow Losing
5 Athi Mawa Rawatuwa Sinhala Charts New Love Sorrow Losing
5 Sithama Ridawa Sinhala Charts New Love Sorrow Losing
6 Ennai thalaatta Tamil Movie New Love
7 Dheere Dheere Hindi Movie New Love
7 Ananthen Aa Tharu Kumara Sinhala Teledrama New Love
8 Chinna Mani Kuyile Tamil Movie Old Love
Sub
No
Recommendation Song Set of
Subscriber
Language Source Release Theme1 Theme2 Theme3
2 Ayeth Warak Sinhala Charts New Love Sorrow Losing
2 Ayeth Warak Sinhala Charts New Love Sorrow Losing
2 Ayeth Warak Sinhala Charts New Love Sorrow Losing
3 Awasana Premayai Sinhala Charts New Love Sorrow
4 Hadawatha Gahena Sinhala Charts New Love Sorrow Losing
4 Awasana Premayai Sinhala Charts New Love Sorrow
5 Ayeth Warak Sinhala Charts New Love Sorrow Losing
5 Ayeth Warak Sinhala Charts New Love Sorrow Losing
6 Kannukulle Tamil Movie Old Love
7 Awasana Premayai Sinhala Charts New Love Sorrow
7 Dukama Vidala Sinhala Charts New Love Sorrow Losing
8 Kanne En Kanmaniye. Tamil Movie Old Love
8 Enna Oru Enna Oru Tamil Movie New Love
RESULTS – CASE OF SUBSCRIBER #3
Sinhala Charts New Love Sorrow Losing
Slide | 10
Video source: youtube.com
Video source: youtube.com
IMPLEMENTATION AND OPERATIONALIZATION
Slide | 11
Operationalized in Business Intelligence Systems at Dialog Axiata
Select the best marketing channel for each individual based on
 Download via Interactive Voice Response, Web, SMS or copy from another RBTS user
 customized SMS giving recommendations & direct dial short code for download
 past RBTS downloading patterns
 core Telecommunication Service usage behavior of individual
Options for Targeting existing subscribers or previous subscribers
subscribers with many song subscriptions
who change regularly
Non engaged users, who has
downloaded songs in past
CONCLUSION
Slide | 12
 Algorithm meets consumer taste in songs with new songs similar in its intrinsic qualities
 Fast Association Rule Generation with apriori performance constraints
 Recommendation via Tastes of the Individual and “Nearest Neighbor’s in Taste”
 Recommendations independent of Meta Data
 Content Characterization via Items of Content itself
• Consumers choices are correlated when the “intrinsic” properties of the content are also similar
 Intrinsic Properties - Type, Theme , Content…
• Novel Algorithm provides Individualized Recommendations matching Customer taste in Ring Back Tone Songs
• Retain and Satisfy the Existing base & Entice New Customers to Network
 Increase stickiness to Network
FUTURE APPLICATIONS OF THE ALGORITHM
Slide | 13
• Apply model to other products in portfolio with similar consumer appeal
• Insight in to identifying “Personality Type” of consumers
 Design campaign look and feel
 Push Products that meet personality criteria
 better targeting via Personality Type
THANK YOU
Q&A
Slide | 14

More Related Content

Similar to Recommender Algorithm for PRBT BiPartite Networks - IESL 18 Oct 2016_final_use_this

Using Rank Aggregation in Continuously Answering SPARQL Queries on Streaming ...
Using Rank Aggregation in Continuously Answering SPARQL Queries on Streaming ...Using Rank Aggregation in Continuously Answering SPARQL Queries on Streaming ...
Using Rank Aggregation in Continuously Answering SPARQL Queries on Streaming ...Shima Zahmatkesh
 
Xomia_20220602.pptx
Xomia_20220602.pptxXomia_20220602.pptx
Xomia_20220602.pptxLonghow Lam
 
movie recommender system using vectorization and SVD tech
movie recommender system using vectorization and SVD techmovie recommender system using vectorization and SVD tech
movie recommender system using vectorization and SVD techUddeshBhagat
 
Twente ir-course 20-10-2010
Twente ir-course 20-10-2010Twente ir-course 20-10-2010
Twente ir-course 20-10-2010Arjen de Vries
 
When a FILTER makes the di fference in continuously answering SPARQL queries ...
When a FILTER makes the difference in continuously answering SPARQL queries ...When a FILTER makes the difference in continuously answering SPARQL queries ...
When a FILTER makes the di fference in continuously answering SPARQL queries ...Shima Zahmatkesh
 
CSTalks-Quaternary Semantics Recomandation System-24 Aug
CSTalks-Quaternary Semantics Recomandation System-24 AugCSTalks-Quaternary Semantics Recomandation System-24 Aug
CSTalks-Quaternary Semantics Recomandation System-24 Augcstalks
 
Collaborative Filtering 1: User-based CF
Collaborative Filtering 1: User-based CFCollaborative Filtering 1: User-based CF
Collaborative Filtering 1: User-based CFYusuke Yamamoto
 
Recsys 2018 overview and highlights
Recsys 2018 overview and highlightsRecsys 2018 overview and highlights
Recsys 2018 overview and highlightsSandra Garcia
 
Movie recommendation Engine using Artificial Intelligence
Movie recommendation Engine using Artificial IntelligenceMovie recommendation Engine using Artificial Intelligence
Movie recommendation Engine using Artificial IntelligenceHarivamshi D
 
Increasing Movie Viewership: A Promotional Campaign Strategy Research
Increasing Movie Viewership: A Promotional Campaign Strategy ResearchIncreasing Movie Viewership: A Promotional Campaign Strategy Research
Increasing Movie Viewership: A Promotional Campaign Strategy ResearchRAHUL SINGH
 
Multi-agent-TV-recommender-paper
Multi-agent-TV-recommender-paperMulti-agent-TV-recommender-paper
Multi-agent-TV-recommender-paperKaushal Kurapati
 
Overview of recommender system
Overview of recommender systemOverview of recommender system
Overview of recommender systemStanley Wang
 
Rokach-GomaxSlides.pptx
Rokach-GomaxSlides.pptxRokach-GomaxSlides.pptx
Rokach-GomaxSlides.pptxJadna Almeida
 
Rokach-GomaxSlides (1).pptx
Rokach-GomaxSlides (1).pptxRokach-GomaxSlides (1).pptx
Rokach-GomaxSlides (1).pptxJadna Almeida
 
Relevant Query Answering on Dynamic and Distributed Datasets
Relevant Query Answering on Dynamic and Distributed DatasetsRelevant Query Answering on Dynamic and Distributed Datasets
Relevant Query Answering on Dynamic and Distributed DatasetsShima Zahmatkesh
 
The Wisdom of the Few @SIGIR09
The Wisdom of the Few @SIGIR09The Wisdom of the Few @SIGIR09
The Wisdom of the Few @SIGIR09Xavier Amatriain
 
Collaborative Filtering Recommendation System
Collaborative Filtering Recommendation SystemCollaborative Filtering Recommendation System
Collaborative Filtering Recommendation SystemMilind Gokhale
 
I want to answer, who has a
I want to answer, who has aI want to answer, who has a
I want to answer, who has achenbojyh
 

Similar to Recommender Algorithm for PRBT BiPartite Networks - IESL 18 Oct 2016_final_use_this (20)

Using Rank Aggregation in Continuously Answering SPARQL Queries on Streaming ...
Using Rank Aggregation in Continuously Answering SPARQL Queries on Streaming ...Using Rank Aggregation in Continuously Answering SPARQL Queries on Streaming ...
Using Rank Aggregation in Continuously Answering SPARQL Queries on Streaming ...
 
Xomia_20220602.pptx
Xomia_20220602.pptxXomia_20220602.pptx
Xomia_20220602.pptx
 
movie recommender system using vectorization and SVD tech
movie recommender system using vectorization and SVD techmovie recommender system using vectorization and SVD tech
movie recommender system using vectorization and SVD tech
 
Twente ir-course 20-10-2010
Twente ir-course 20-10-2010Twente ir-course 20-10-2010
Twente ir-course 20-10-2010
 
When a FILTER makes the di fference in continuously answering SPARQL queries ...
When a FILTER makes the difference in continuously answering SPARQL queries ...When a FILTER makes the difference in continuously answering SPARQL queries ...
When a FILTER makes the di fference in continuously answering SPARQL queries ...
 
CSTalks-Quaternary Semantics Recomandation System-24 Aug
CSTalks-Quaternary Semantics Recomandation System-24 AugCSTalks-Quaternary Semantics Recomandation System-24 Aug
CSTalks-Quaternary Semantics Recomandation System-24 Aug
 
Collaborative Filtering 1: User-based CF
Collaborative Filtering 1: User-based CFCollaborative Filtering 1: User-based CF
Collaborative Filtering 1: User-based CF
 
Recsys 2018 overview and highlights
Recsys 2018 overview and highlightsRecsys 2018 overview and highlights
Recsys 2018 overview and highlights
 
Movie recommendation Engine using Artificial Intelligence
Movie recommendation Engine using Artificial IntelligenceMovie recommendation Engine using Artificial Intelligence
Movie recommendation Engine using Artificial Intelligence
 
Increasing Movie Viewership: A Promotional Campaign Strategy Research
Increasing Movie Viewership: A Promotional Campaign Strategy ResearchIncreasing Movie Viewership: A Promotional Campaign Strategy Research
Increasing Movie Viewership: A Promotional Campaign Strategy Research
 
Multi-agent-TV-recommender-paper
Multi-agent-TV-recommender-paperMulti-agent-TV-recommender-paper
Multi-agent-TV-recommender-paper
 
Overview of recommender system
Overview of recommender systemOverview of recommender system
Overview of recommender system
 
Rokach-GomaxSlides.pptx
Rokach-GomaxSlides.pptxRokach-GomaxSlides.pptx
Rokach-GomaxSlides.pptx
 
Rokach-GomaxSlides (1).pptx
Rokach-GomaxSlides (1).pptxRokach-GomaxSlides (1).pptx
Rokach-GomaxSlides (1).pptx
 
Relevant Query Answering on Dynamic and Distributed Datasets
Relevant Query Answering on Dynamic and Distributed DatasetsRelevant Query Answering on Dynamic and Distributed Datasets
Relevant Query Answering on Dynamic and Distributed Datasets
 
The Wisdom of the Few @SIGIR09
The Wisdom of the Few @SIGIR09The Wisdom of the Few @SIGIR09
The Wisdom of the Few @SIGIR09
 
Fashiondatasc
FashiondatascFashiondatasc
Fashiondatasc
 
Collaborative Filtering Recommendation System
Collaborative Filtering Recommendation SystemCollaborative Filtering Recommendation System
Collaborative Filtering Recommendation System
 
Netflix RS
Netflix   RSNetflix   RS
Netflix RS
 
I want to answer, who has a
I want to answer, who has aI want to answer, who has a
I want to answer, who has a
 

More from Asoka Korale

Improving predictability and performance by relating the number of events and...
Improving predictability and performance by relating the number of events and...Improving predictability and performance by relating the number of events and...
Improving predictability and performance by relating the number of events and...Asoka Korale
 
Improving predictability and performance by relating the number of events and...
Improving predictability and performance by relating the number of events and...Improving predictability and performance by relating the number of events and...
Improving predictability and performance by relating the number of events and...Asoka Korale
 
Novel price models in the capital market
Novel price models in the capital marketNovel price models in the capital market
Novel price models in the capital marketAsoka Korale
 
Modeling prices for capital market surveillance
Modeling prices for capital market surveillanceModeling prices for capital market surveillance
Modeling prices for capital market surveillanceAsoka Korale
 
Entity profling and collusion detection
Entity profling and collusion detectionEntity profling and collusion detection
Entity profling and collusion detectionAsoka Korale
 
Entity Profiling and Collusion Detection
Entity Profiling and Collusion DetectionEntity Profiling and Collusion Detection
Entity Profiling and Collusion DetectionAsoka Korale
 
Markov Decision Processes in Market Surveillance
Markov Decision Processes in Market SurveillanceMarkov Decision Processes in Market Surveillance
Markov Decision Processes in Market SurveillanceAsoka Korale
 
A framework for dynamic pricing electricity consumption patterns via time ser...
A framework for dynamic pricing electricity consumption patterns via time ser...A framework for dynamic pricing electricity consumption patterns via time ser...
A framework for dynamic pricing electricity consumption patterns via time ser...Asoka Korale
 
A framework for dynamic pricing electricity consumption patterns via time ser...
A framework for dynamic pricing electricity consumption patterns via time ser...A framework for dynamic pricing electricity consumption patterns via time ser...
A framework for dynamic pricing electricity consumption patterns via time ser...Asoka Korale
 
Customer Lifetime Value Modeling
Customer Lifetime Value ModelingCustomer Lifetime Value Modeling
Customer Lifetime Value ModelingAsoka Korale
 
Forecasting models for Customer Lifetime Value
Forecasting models for Customer Lifetime ValueForecasting models for Customer Lifetime Value
Forecasting models for Customer Lifetime ValueAsoka Korale
 
Capacity and utilization enhancement
Capacity and utilization enhancementCapacity and utilization enhancement
Capacity and utilization enhancementAsoka Korale
 
Cell load KPIs in support of event triggered Cellular Yield Maximization
Cell load KPIs in support of event triggered Cellular Yield MaximizationCell load KPIs in support of event triggered Cellular Yield Maximization
Cell load KPIs in support of event triggered Cellular Yield MaximizationAsoka Korale
 
Vehicular Traffic Monitoring Scenarios
Vehicular Traffic Monitoring ScenariosVehicular Traffic Monitoring Scenarios
Vehicular Traffic Monitoring ScenariosAsoka Korale
 
Mixed Numeric and Categorical Attribute Clustering Algorithm
Mixed Numeric and Categorical Attribute Clustering AlgorithmMixed Numeric and Categorical Attribute Clustering Algorithm
Mixed Numeric and Categorical Attribute Clustering AlgorithmAsoka Korale
 
Introduction to Bit Coin Model
Introduction to Bit Coin ModelIntroduction to Bit Coin Model
Introduction to Bit Coin ModelAsoka Korale
 
Estimating Gaussian Mixture Densities via an implemetation of the Expectaatio...
Estimating Gaussian Mixture Densities via an implemetation of the Expectaatio...Estimating Gaussian Mixture Densities via an implemetation of the Expectaatio...
Estimating Gaussian Mixture Densities via an implemetation of the Expectaatio...Asoka Korale
 
Mapping Mobile Average Revenue per User to Personal Income level via Househol...
Mapping Mobile Average Revenue per User to Personal Income level via Househol...Mapping Mobile Average Revenue per User to Personal Income level via Househol...
Mapping Mobile Average Revenue per User to Personal Income level via Househol...Asoka Korale
 
Asoka_Korale_Event_based_CYM_IET_2013_submitted linkedin
Asoka_Korale_Event_based_CYM_IET_2013_submitted linkedinAsoka_Korale_Event_based_CYM_IET_2013_submitted linkedin
Asoka_Korale_Event_based_CYM_IET_2013_submitted linkedinAsoka Korale
 
event tiggered cellular yield enhancement linkedin
event tiggered cellular yield enhancement linkedinevent tiggered cellular yield enhancement linkedin
event tiggered cellular yield enhancement linkedinAsoka Korale
 

More from Asoka Korale (20)

Improving predictability and performance by relating the number of events and...
Improving predictability and performance by relating the number of events and...Improving predictability and performance by relating the number of events and...
Improving predictability and performance by relating the number of events and...
 
Improving predictability and performance by relating the number of events and...
Improving predictability and performance by relating the number of events and...Improving predictability and performance by relating the number of events and...
Improving predictability and performance by relating the number of events and...
 
Novel price models in the capital market
Novel price models in the capital marketNovel price models in the capital market
Novel price models in the capital market
 
Modeling prices for capital market surveillance
Modeling prices for capital market surveillanceModeling prices for capital market surveillance
Modeling prices for capital market surveillance
 
Entity profling and collusion detection
Entity profling and collusion detectionEntity profling and collusion detection
Entity profling and collusion detection
 
Entity Profiling and Collusion Detection
Entity Profiling and Collusion DetectionEntity Profiling and Collusion Detection
Entity Profiling and Collusion Detection
 
Markov Decision Processes in Market Surveillance
Markov Decision Processes in Market SurveillanceMarkov Decision Processes in Market Surveillance
Markov Decision Processes in Market Surveillance
 
A framework for dynamic pricing electricity consumption patterns via time ser...
A framework for dynamic pricing electricity consumption patterns via time ser...A framework for dynamic pricing electricity consumption patterns via time ser...
A framework for dynamic pricing electricity consumption patterns via time ser...
 
A framework for dynamic pricing electricity consumption patterns via time ser...
A framework for dynamic pricing electricity consumption patterns via time ser...A framework for dynamic pricing electricity consumption patterns via time ser...
A framework for dynamic pricing electricity consumption patterns via time ser...
 
Customer Lifetime Value Modeling
Customer Lifetime Value ModelingCustomer Lifetime Value Modeling
Customer Lifetime Value Modeling
 
Forecasting models for Customer Lifetime Value
Forecasting models for Customer Lifetime ValueForecasting models for Customer Lifetime Value
Forecasting models for Customer Lifetime Value
 
Capacity and utilization enhancement
Capacity and utilization enhancementCapacity and utilization enhancement
Capacity and utilization enhancement
 
Cell load KPIs in support of event triggered Cellular Yield Maximization
Cell load KPIs in support of event triggered Cellular Yield MaximizationCell load KPIs in support of event triggered Cellular Yield Maximization
Cell load KPIs in support of event triggered Cellular Yield Maximization
 
Vehicular Traffic Monitoring Scenarios
Vehicular Traffic Monitoring ScenariosVehicular Traffic Monitoring Scenarios
Vehicular Traffic Monitoring Scenarios
 
Mixed Numeric and Categorical Attribute Clustering Algorithm
Mixed Numeric and Categorical Attribute Clustering AlgorithmMixed Numeric and Categorical Attribute Clustering Algorithm
Mixed Numeric and Categorical Attribute Clustering Algorithm
 
Introduction to Bit Coin Model
Introduction to Bit Coin ModelIntroduction to Bit Coin Model
Introduction to Bit Coin Model
 
Estimating Gaussian Mixture Densities via an implemetation of the Expectaatio...
Estimating Gaussian Mixture Densities via an implemetation of the Expectaatio...Estimating Gaussian Mixture Densities via an implemetation of the Expectaatio...
Estimating Gaussian Mixture Densities via an implemetation of the Expectaatio...
 
Mapping Mobile Average Revenue per User to Personal Income level via Househol...
Mapping Mobile Average Revenue per User to Personal Income level via Househol...Mapping Mobile Average Revenue per User to Personal Income level via Househol...
Mapping Mobile Average Revenue per User to Personal Income level via Househol...
 
Asoka_Korale_Event_based_CYM_IET_2013_submitted linkedin
Asoka_Korale_Event_based_CYM_IET_2013_submitted linkedinAsoka_Korale_Event_based_CYM_IET_2013_submitted linkedin
Asoka_Korale_Event_based_CYM_IET_2013_submitted linkedin
 
event tiggered cellular yield enhancement linkedin
event tiggered cellular yield enhancement linkedinevent tiggered cellular yield enhancement linkedin
event tiggered cellular yield enhancement linkedin
 

Recommender Algorithm for PRBT BiPartite Networks - IESL 18 Oct 2016_final_use_this

  • 1. RECOMMENDER ALGORITHM FOR BIPARTITE NETWORKS USING ASSOCIATION RULES TO DISCOVER CHARACTERISTICS INTRINSIC TO THE CONTENT By Eng. (Dr) Asoka Korale, C.Eng., MIESL Eng. Nilanka Weeraman, AMIESL
  • 2. BUSINESS CASE FOR MOBILE RING BACK TONE RECOMMENDER SYSTEM Slide | 2 • Intense Competition and Low Margins in Traditional Mobile Service Applications  Require Automated System of Reference  Promote High Value Ring Back Tone Content  Customer mostly unaware of available choice  Huge Opportunity - Vast Choice - 10,000 songs • Exploit Novelty and Attractive power of Value Added Services (VAS) portfolio • Wide variation in Customer Preferences and Tastes But  Match Customer tastes with available content  Develop new Revenue Streams • Wide variation in the “Type” &“Intrinsic” properties of content (Themes, Concepts, Genres…)
  • 3. NOVEL CONTRIBUTIONS OF THE RECOMMENDER ALGORITHM Slide | 3 • Characterize Content utilizing items of Content itself • Consumer Taste and Preference matched via “intrinsic” properties of the content • Fast Association Rule generation Algorithm satisfying a-priori constraints on performance measures • Recommendation uses Individual’s “Taste” and preferences of “Nearest Neighbors in Taste”  Neighbors from single mode form of Consumer Vs. Content Bi-Partite Network  Rules at each stage generated via Rules from previous stage that met Performance criteria A B & D& CA B & CA B  Recommendation independent of “meta data”  A song is itself a “category” of song – representing a larger set of songs
  • 4. NOVEL ASSOCIATION RULE ALGORITHM Slide | 4 Customer Vs. Song Choice Incidence Matrix Song Subscription Customer A B C D Cx1 1 0 1 1 Cx2 0 0 1 1 .. .. .. .. .. … .. … … … Cxm Total NA NB NC ND Test support for all pairs 4C2 = 6 combinations {A,B}, {A,C}, {A,D}, {B,C}, {B,D}, {C,D} Stage 1 Let NA, NB, NC & ND exceed the minimum support criteria Initial Stage – Test Support of all Individual Items Stage 2  Support for any combination of items (songs) can be found by the “ sum of the element by element product“ of the respective columns STOP when a certain Rule depth “N” reached Or when all Rule combinations are created subject to the minimum support criteria Stage 3 Test Support for combinations with new consequent terms taken from set that satisfy minimum support criteria Test: A&B->C, A&B->D, A&C->B, A&C->D, C&D->A , C&D->B Stage 2 Rules: A&B->C Merge Antecedent and Consequent terms of Rules in Stage 1 & CA B …………….. …………….. Merge Antecedent and Consequent terms of Rules in Stage 2 D&& CA B Create Rules only for pairs that meet min support criteria Assume {A,B}, {A,C}, {B,C}, {C,D} meet criteria Stage 1 Rules: A->B, A->C, B->C, C->D A B  Example: Under the right conditions the rules may take the form
  • 5. RECOMMENDER ALGORITHM – NEAREST NEIGHBOR SET DETERMINATION Slide | 5 Song Subscription Customer A B C D E F G H Cx1 1 0 1 1 0 1 0 1 Cx2 0 0 1 1 1 0 0 1 Cx3 1 0 0 0 0 0 1 0 Cx4 1 0 1 0 0 0 1 0 … .. … … … … … … … 1. Determine all “Cxi” that share at least one item in common with Target Customer Cx1 2. size of subscribed song set of each Cxi = nsiT 3. For each Cxi determine number of songs in common “nsci” with target customer Cx1 4. The neighbour set: is set that meet apriori limits on “nsiT” and “nsci” 5. The limits can be set on the basis of the size of the subscription set of the target subscriber Cx1 6. a neighbour of the target subscriber is one • who is within (+/-) 50% the size of the subscription set of Cx1 and • who also matches between (+/-) 30% of the songs in the subscription set of Cx1 7. The neighbour item set : union of the set of items among the subscribers who meet conditions in 6 Customer vs. Song Incidence Matrix Customer vs. Customer Single Mode Network Cx1 Cx2 Cx3 Cx4 2 2 3 1 1 A,G A,C,G A,C,D,F,H C,D,E,H Target Customer Cx2, Cx3, Cx4 are “Nearest Neighbors” in “Taste”
  • 6. Confidence(A->B) = Support(AUB)/Support(A) =P(EA&EB)/P(EA) = P(EB/EA) Where P(EX) is the probability of item X being bought in a particular transaction Select all Rules R1 = {r1,r2,…,rj,…,rK} with Subscription Song set {S} as Antecedent r1: s1->sj r2: s1->sk r3: s2->si r4: s3->sm (j,k,i.m intergers) Filter to Find Rule(s) with highest Confidence Rmax: Max( Confidence(ri) ) ∀i Available Song Set {AS} = Consequent Songs of Rule Set Rmax Determine Neighbor Song Set {NS} Intersection of Neighbor and Available Song sets IS = {AS∩NS} Recommended Set RS = {IS} Recommended Set RS = {AS} Target Customer’s (Cx1) Subscription Song Set S = {s1,s2,…,si,…,sN} Support (A->B)= N(AUB)/N If |IS| > Limit Y N Target Customer Song subscription A, C, D, F, H Neighbors @ min weight = 2 A C D E G H RECOMMENDER ALGORITHM - Slide | 6 Rules for Cx1 Confidence A->B 0.8 A->D 0.5 A->C 0.6 C->B 0.5 C->H 0.6 D->E 0.4 F->G 0.5 H->K 0.4 Filtered Rules Confidence A->B 0.8 C->H 0.6 D->E 0.4 F->G 0.5 H->K 0.4 Available Song Set B H E G K IS E, G, H RS B, E, G, H, K RS E, G, H
  • 7. RESULTS – INSIGHTS INTO CONSUMER BEHAVIOR THROUGH CHOICE OF SONGS Slide | 7 Emotions it stirs Personality is more or less fixed in adults Ring Back Tone Song Preferences based on Psychographic considerations Preference for Music Types and Personality are related Song tastes “related to personality” would also be more or less fixed Ring Back Tone a deeply Personal Choice & an outward Representation of the Consumer Images that come to mind Feelings it inspires Carries deeper meaning to consumer not observed in “meta data”
  • 8. ATTRIBUTES INFLUENCING SONG SELECTION Slide | 8 Dimensions of Consumer Appeal Source Novelty Criteria Release Themes Language love sorrow family Music Charts Teledrama Films New Old Sinhala English Tamil Hindi Instrumental parents religion national cricket Events
  • 9. RESULTS Slide | 9 Sub No Subscription Song Set of Subscriber Language Source Release Theme1 Theme2 Theme3 2 Athi Mawa Rawatuwa Sinhala Charts New Love Sorrow Losing 2 Kandulu Hollala Sinhala Charts New Love Sorrow Losing 2 Sithama Ridawa Sinhala Charts New Love Sorrow Losing 3 Wen Weela Giyada Sinhala Charts New Love Sorrow Losing 4 Nidi Warapu As Walin Sinhala Charts New Love Sorrow Losing 4 Obath Giya Sinhala Charts New Love Sorrow Losing 5 Athi Mawa Rawatuwa Sinhala Charts New Love Sorrow Losing 5 Sithama Ridawa Sinhala Charts New Love Sorrow Losing 6 Ennai thalaatta Tamil Movie New Love 7 Dheere Dheere Hindi Movie New Love 7 Ananthen Aa Tharu Kumara Sinhala Teledrama New Love 8 Chinna Mani Kuyile Tamil Movie Old Love Sub No Recommendation Song Set of Subscriber Language Source Release Theme1 Theme2 Theme3 2 Ayeth Warak Sinhala Charts New Love Sorrow Losing 2 Ayeth Warak Sinhala Charts New Love Sorrow Losing 2 Ayeth Warak Sinhala Charts New Love Sorrow Losing 3 Awasana Premayai Sinhala Charts New Love Sorrow 4 Hadawatha Gahena Sinhala Charts New Love Sorrow Losing 4 Awasana Premayai Sinhala Charts New Love Sorrow 5 Ayeth Warak Sinhala Charts New Love Sorrow Losing 5 Ayeth Warak Sinhala Charts New Love Sorrow Losing 6 Kannukulle Tamil Movie Old Love 7 Awasana Premayai Sinhala Charts New Love Sorrow 7 Dukama Vidala Sinhala Charts New Love Sorrow Losing 8 Kanne En Kanmaniye. Tamil Movie Old Love 8 Enna Oru Enna Oru Tamil Movie New Love
  • 10. RESULTS – CASE OF SUBSCRIBER #3 Sinhala Charts New Love Sorrow Losing Slide | 10 Video source: youtube.com Video source: youtube.com
  • 11. IMPLEMENTATION AND OPERATIONALIZATION Slide | 11 Operationalized in Business Intelligence Systems at Dialog Axiata Select the best marketing channel for each individual based on  Download via Interactive Voice Response, Web, SMS or copy from another RBTS user  customized SMS giving recommendations & direct dial short code for download  past RBTS downloading patterns  core Telecommunication Service usage behavior of individual Options for Targeting existing subscribers or previous subscribers subscribers with many song subscriptions who change regularly Non engaged users, who has downloaded songs in past
  • 12. CONCLUSION Slide | 12  Algorithm meets consumer taste in songs with new songs similar in its intrinsic qualities  Fast Association Rule Generation with apriori performance constraints  Recommendation via Tastes of the Individual and “Nearest Neighbor’s in Taste”  Recommendations independent of Meta Data  Content Characterization via Items of Content itself • Consumers choices are correlated when the “intrinsic” properties of the content are also similar  Intrinsic Properties - Type, Theme , Content… • Novel Algorithm provides Individualized Recommendations matching Customer taste in Ring Back Tone Songs • Retain and Satisfy the Existing base & Entice New Customers to Network  Increase stickiness to Network
  • 13. FUTURE APPLICATIONS OF THE ALGORITHM Slide | 13 • Apply model to other products in portfolio with similar consumer appeal • Insight in to identifying “Personality Type” of consumers  Design campaign look and feel  Push Products that meet personality criteria  better targeting via Personality Type