2019
DOI: 10.1016/j.ins.2019.01.023
|View full text |Cite
|
Sign up to set email alerts
|

An efficient recommendation generation using relevant Jaccard similarity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
89
0
2

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 231 publications
(91 citation statements)
references
References 40 publications
0
89
0
2
Order By: Relevance
“…User similarity calculation is an important technique for collaborative filtering methods. Traditional techniques, including the Cosine similarity model [47], Jaccard similarity model [48], and HP (Hub Promoted) model [49], are widely used. Another widely used technique is the number of common neighbors between users, which considers the more common neighbor friends between users, the higher the similarity between them [50].…”
Section: Mobile Marketing Recommendation Methodsmentioning
confidence: 99%
“…User similarity calculation is an important technique for collaborative filtering methods. Traditional techniques, including the Cosine similarity model [47], Jaccard similarity model [48], and HP (Hub Promoted) model [49], are widely used. Another widely used technique is the number of common neighbors between users, which considers the more common neighbor friends between users, the higher the similarity between them [50].…”
Section: Mobile Marketing Recommendation Methodsmentioning
confidence: 99%
“…Where jk U is the weight matrix going between j and k neurons, j S defines the unit condition k and j  described the threshold function of neurons j. Several studies [28,[42][43][44][45][46][47][48] defined 0 j  = to verify that the HNN always leads to a decrease in energy monotonically. Each time neuron was connected with jk U ,the value of the connection will be preserved as a stored pattern in an interconnected vector where [36,60] that the constraint of synaptic weight matrix (1) U and does not allow self-loop neuron connection…”
Section: Discrete Hopfield Neural Networkmentioning
confidence: 99%
“…Authors Bobadilla et al have proposed various similarity measures by exploiting the different contextual information [29,30,31,32].Patra et al [33] have adopted the Bhattacharyya coefficient to define a new similarity measure that also manages the data-sparsity problem. Recently, the Jaccard similarity index [34] has been modified to relevant Jaccard similarity [35] for efficient recommendations.…”
Section:  Collaborativementioning
confidence: 99%