IISA 2014, the 5th International Conference on Information, Intelligence, Systems and Applications 2014
DOI: 10.1109/iisa.2014.6878720
|View full text |Cite
|
Sign up to set email alerts
|

A content based approach for recommending personnel for job positions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
4
2

Relationship

1
9

Authors

Journals

citations
Cited by 23 publications
(8 citation statements)
references
References 13 publications
0
8
0
Order By: Relevance
“…Except from this shortfall of the existing techniques, there is also another obstacle to be addressed, namely the crowd problem. In many domains, some researchers call it crowd wisdom and it could be wisdom in job seeking and recruiting domain only in some cases (i.e., 1-N and N-1) which we handled well in a previous work of ours (Almalis et al, 2014). But in the N-N case, the crowd problem arises significantly as it is common for many suitable job seekers to be found for one job, but no one for some other.…”
Section: Job Recommendation Systemsmentioning
confidence: 83%
“…Except from this shortfall of the existing techniques, there is also another obstacle to be addressed, namely the crowd problem. In many domains, some researchers call it crowd wisdom and it could be wisdom in job seeking and recruiting domain only in some cases (i.e., 1-N and N-1) which we handled well in a previous work of ours (Almalis et al, 2014). But in the N-N case, the crowd problem arises significantly as it is common for many suitable job seekers to be found for one job, but no one for some other.…”
Section: Job Recommendation Systemsmentioning
confidence: 83%
“…by using weighted versions of these operators. Other works have considered simpler fusion strategies such as a sum or product of unidirectional preferences [13,153], whereas other have used logical connectives [89], set intersection between both users' recommendation lists [161] or aggregation of the ranking positions of x and y in each other's recommendation lists [107], to name a few. Some challenges and areas for Harmonic mean combined with sum Sudo et al [148] Sum of similarities/distances Almalis et al [13], Yu et al [166] Product operator Ting et al [153], Li and Li [96] Weighted mean Kleinermann et al [84], Xia et al [158] Multiple averaging and uninorm aggregation functions Neve and Palomares [112,113] Matrix multiplication Jacobsen and Spanakis [75] Set intersection of recommendable users Yacef and McLaren [161], Kutty et al [90] Aggregation (union) of probabilities Pizzato and Silvertrini [125] Average similarity between x and previous successful interactions with y…”
Section: Perspective A: Fusion Strategies and Reciprocitymentioning
confidence: 99%
“…The principle of a content-based [3] recommender [9][10] is to suggest items that have similar content to ones the target user prefers. The process of content-based recommender is selecting the same feature type and comparing them by calculating their similarity for people and jobs [23].…”
Section: Content Based Recommendation Designmentioning
confidence: 99%