Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mohsan Jameel

dblp:48/4083 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2020
0000-0002-9674-2134ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 3 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorComputer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
collaborative filtering
0.312018
Towards Distributed Pairwise Ranking using Implicit Feedback · SIGIR 2018
Recommender systems › personalized ranking
collaborative ranking
0.312018
Towards Distributed Pairwise Ranking using Implicit Feedback · SIGIR 2018
Recommender systems › collaborative filtering
implicit feedback
0.312018
Towards Distributed Pairwise Ranking using Implicit Feedback · SIGIR 2018
Recommender systems › personalized ranking
pairwise ranking
0.312018
Towards Distributed Pairwise Ranking using Implicit Feedback · SIGIR 2018
Distributed systems
distributed machine learning
0.112018
Towards Distributed Pairwise Ranking using Implicit Feedback · SIGIR 2018

Methods — techniques the papers use, named apart from their topics

stochastic gradient descent · 0.7factorization machines · 0.7block partitioning · 0.7
YearPublicationVenuePosition
2020 Optimal Topology Search for Fast Model Averaging in Decentralized Parallel SGD
Mohsan Jameel, Shayan Jawed, Lars Schmidt-Thieme
PAKDD (2)1
2020 Automation of Leasing Vehicle Return Assessment Using Deep Learning Models
Mohsan Jameel, Mofassir ul Islam Arif, Andre Hintsches, Lars Schmidt-Thieme
ECML/PKDD (4)1
2018 Towards Distributed Pairwise Ranking using Implicit Feedback
abstract
Learning with pairwise ranking methods for implicit feedback datasets has shown promising results as compared to pointwise ranking methods for recommendation tasks. However, there is limited effort in scaling the pairwise ranking methods in a large scale distributed setting. In this paper we address the scalability aspect of a pairwise ranking method using Factorization Machines in distributed settings. Our proposed method is based on a block partitioning of the model parameters so that each distributed worker runs stochastic gradient updates on an independent block. We developed a dynamic block creation and exchange strategy by utilizing the frequency of occurrence of a feature in the local training data of a worker. Empirical evidence on publicly available benchmark datasets indicates that the proposed method scales better than the static block based methods and outperforms competing state-of-the-art methods.
Mohsan Jameel, Nicolas Schilling, Lars Schmidt-Thieme
SIGIR1
2006 An Efficient Approach Towards IP Network Topology Discovery for Large Multi-Subnet Networks
abstract
Knowledge of the up-to-date network topology (i.e. Layer 2 & Layer 3) is crucial for efficient network management. Issues like congestion avoidance, resource management, resource discovery, root-cause analysis and event correlation require accurate information of the topology map. Due to dynamic nature of today’s IP networks, keeping track of topology information manually is a daunting task. Thus efficient algorithms for automatically discovering physical network topology are necessary. The earlier work has typically concentrated on discovering topology either using completely SNMP-MIB or ICMP echo request/reply, DNS, Trace route, etc. Our proposed algorithm does not rely totally on SNMP-MIB information as it is not usually supported by all devices in the network. Instead we propose an approach where SNMP agent should only be enabled on the routers and managed switches. Rest of the network computers/hosts need not have SNMP agent enabled. We propose an efficient algorithm not only to find available computers/hosts but also to find appropriate timeouts and delays in the network. The experimental results validate our approach, demonstrating that our algorithm discovers accurate physical topology.
Fawad Nazir, Mohsan Jameel, Tallat Hussain Tarar, Hamid Abbas Burki, Hafiz Farooq Ahmad, Arshad Ali 0001, Hiroki Suguri
ISCC2