Search Results for author: Mohammed Korayem

Found 12 papers, 1 papers with code

Embedding-based Recommender System for Job to Candidate Matching on Scale

no code implementations1 Jul 2021 Jing Zhao, Jingya Wang, Madhav Sigdel, Bopeng Zhang, Phuong Hoang, Mengshu Liu, Mohammed Korayem

The overall improvement of our job to candidate matching system has demonstrated its feasibility and scalability at a major online recruitment site.

Recommendation Systems Representation Learning +1

Automated Discovery and Classification of Training Videos for Career Progression

no code implementations23 Jul 2019 Alan Chern, Phuong Hoang, Madhav Sigdel, Janani Balaji, Mohammed Korayem

Job transitions and upskilling are common actions taken by many industry working professionals throughout their career.

General Classification Navigate

Tripartite Vector Representations for Better Job Recommendation

no code implementations23 Jul 2019 Mengshu Liu, Jingya Wang, Kareem Abdelfatah, Mohammed Korayem

Job recommendation is a crucial part of the online job recruitment business.

Solving Cold-Start Problem in Large-scale Recommendation Engines: A Deep Learning Approach

no code implementations16 Nov 2016 Jianbo Yuan, Walid Shalaby, Mohammed Korayem, David Lin, Khalifeh Aljadda, Jiebo Luo

One of the most important features of the proposed technique is the fact that it can be applied on top of any existing CF based recommendation engine without changing the CF core.

Collaborative Filtering

The Semantic Knowledge Graph: A compact, auto-generated model for real-time traversal and ranking of any relationship within a domain

5 code implementations2 Sep 2016 Trey Grainger, Khalifeh Aljadda, Mohammed Korayem, Andries Smith

This provides numerous benefits: the knowledge graph can be built automatically from a real-world corpus of data, new nodes - along with their combined edges - can be instantly materialized from any arbitrary combination of preexisting nodes (using set operations), and a full model of the semantic relationships between all entities within a domain can be represented and dynamically traversed using a highly compact representation of the graph.

Anomaly Detection

Application of Statistical Relational Learning to Hybrid Recommendation Systems

no code implementations4 Jul 2016 Shuo Yang, Mohammed Korayem, Khalifeh Aljadda, Trey Grainger, Sriraam Natarajan

In this paper, we proposed a way to adapt the state-of-the-art in SRL learning approaches to construct a real hybrid recommendation system.

Collaborative Filtering Feature Engineering +2

Sentiment/Subjectivity Analysis Survey for Languages other than English

no code implementations1 Jan 2016 Mohammed Korayem, Khalifeh Aljadda, David Crandall

This paper surveys different ways used for building systems for subjective and sentiment analysis for languages other than English.

Arabic Sentiment Analysis Subjectivity Analysis

GELATO and SAGE: An Integrated Framework for MS Annotation

no code implementations28 Dec 2015 Khalifeh AlJadda, Rene Ranzinger, Melody Porterfield, Brent Weatherly, Mohammed Korayem, John A. Miller, Khaled Rasheed, Krys J. Kochut, William S. York

The first, is a free, semi-automated MSn data interpreter called the Glycomic Elucidation and Annotation Tool (GELATO).

Mining Massive Hierarchical Data Using a Scalable Probabilistic Graphical Model

no code implementations28 Dec 2015 Khalifeh AlJadda, Mohammed Korayem, Camilo Ortiz, Trey Grainger, John A. Miller, Khaled Rasheed, Krys J. Kochut, William S. York, Rene Ranzinger, Melody Porterfield

In this paper we introduce an extension to Bayesian Networks to handle massive sets of hierarchical data in a reasonable amount of time and space.

BIG-bench Machine Learning

PGMHD: A Scalable Probabilistic Graphical Model for Massive Hierarchical Data Problems

no code implementations21 Jul 2014 Khalifeh AlJadda, Mohammed Korayem, Camilo Ortiz, Trey Grainger, John A. Miller, William S. York

When modeling this kind of hierarchical data across large data sets, Bayesian networks become infeasible for representing the probability distributions for the following reasons: i) Each level represents a single random variable with hundreds of thousands of values, ii) The number of levels is usually small, so there are also few random variables, and iii) The structure of the network is predefined since the dependency is modeled top-down from each parent to each of its child nodes, so the network would contain a single linear path for the random variables from each parent to each child node.

Cannot find the paper you are looking for? You can Submit a new open access paper.