2017
DOI: 10.1007/s12652-017-0484-6
|View full text |Cite
|
Sign up to set email alerts
|

The workforce analyzer: group discovery among LinkedIn public profiles

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 31 publications
0
6
0
1
Order By: Relevance
“…In LinkedIn, Dai et al (2018) implemented unsupervised learning and SVM to classify profiles according to their professional background, to find the trends of the workforce professional orientation from an online viewpoint. In the same way, Piedboeuf et al (2019) were able to extract the personality from profiles with reliable precision, using two personality models in a way to understand employees or co-workers better: Myer-Briggs (also known as MBTI) and DiSC (dominance, influence, steadiness, and conscientiousness).…”
Section: Practical Implications In Twitter and Linkedinmentioning
confidence: 99%
See 4 more Smart Citations
“…In LinkedIn, Dai et al (2018) implemented unsupervised learning and SVM to classify profiles according to their professional background, to find the trends of the workforce professional orientation from an online viewpoint. In the same way, Piedboeuf et al (2019) were able to extract the personality from profiles with reliable precision, using two personality models in a way to understand employees or co-workers better: Myer-Briggs (also known as MBTI) and DiSC (dominance, influence, steadiness, and conscientiousness).…”
Section: Practical Implications In Twitter and Linkedinmentioning
confidence: 99%
“…K-means clustering has computational advantages for large datasets, but it has to be defined as the number of clusters (Steinley, 2006). Utilising the K-means algorithm to discover groups in LinkedIn public profiles, Dai et al (2018) describes that this algorithm is useful in "in determining the point where the graph that represents the number of cluster versus the percentage of variance explained by clusters starts to rise slower." Furthermore, this algorithm implementation is performed through the partition of disjoint K clusters after several iterations grouped by centroids.…”
Section: K-meansmentioning
confidence: 99%
See 3 more Smart Citations