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

Amir Hossein Yazdavar

dblp:148/1563 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2018
0000-0002-3898-9497ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 1 first-authorComputer networks · 1Databases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1 · 1 first-author

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
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge graphs › knowledge graph analytics
entity summarization
0.312017
Relatedness-based Multi-Entity Summarization · IJCAI 2017
Knowledge graphs
knowledge graph mining
0.312017
Relatedness-based Multi-Entity Summarization · IJCAI 2017

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

constrained knapsack problem solving · 0.3
YearPublicationVenuePosition
2018 Rock strength estimation: a PSO-based BP approach
Edy Tonnizam Mohamad, Danial Jahed Armaghani, Ehsan Momeni, Amir Hossein Yazdavar, Monireh Ebrahimi
Neural Comput. Appl.4
2017 Semi-Supervised Approach to Monitoring Clinical Depressive Symptoms in Social Media
abstract
With the rise of social media, millions of people are routinely expressing their moods, feelings, and daily struggles with mental health issues on social media platforms like Twitter. Unlike traditional observational cohort studies conducted through questionnaires and self-reported surveys, we explore the reliable detection of clinical depression from tweets obtained unobtrusively. Based on the analysis of tweets crawled from users with self-reported depressive symptoms in their Twitter profiles, we demonstrate the potential for detecting clinical depression symptoms which emulate the PHQ-9 questionnaire clinicians use today. Our study uses a semi-supervised statistical model to evaluate how the duration of these symptoms and their expression on Twitter (in terms of word usage patterns and topical preferences) align with the medical findings reported via the PHQ-9. Our proactive and automatic screening tool is able to identify clinical depressive symptoms with an accuracy of 68% and precision of 72%.
Amir Hossein Yazdavar, Hussein Al-Olimat, Monireh Ebrahimi, Goonmeet Bajaj, Tanvi Banerjee, Krishnaprasad Thirunarayan, Jyotishman Pathak, Amit P. Sheth
ASONAM1
2017 Relatedness-based Multi-Entity Summarization
abstract
Representing world knowledge in a machine processable format is important as entities and their descriptions have fueled tremendous growth in knowledge-rich information processing platforms, services, and systems. Prominent applications of knowledge graphs include search engines (e.g., Google Search and Microsoft Bing), email clients (e.g., Gmail), and intelligent personal assistants (e.g., Google Now, Amazon Echo, and Apple's Siri). In this paper, we present an approach that can summarize facts about a collection of entities by analyzing their relatedness in preference to summarizing each entity in isolation. Specifically, we generate informative entity summaries by selecting: (i) inter-entity facts that are similar and (ii) intra-entity facts that are important and diverse. We employ a constrained knapsack problem solving approach to efficiently compute entity summaries. We perform both qualitative and quantitative experiments and demonstrate that our approach yields promising results compared to two other stand-alone state-of-the-art entity summarization approaches.
Kalpa Gunaratna, Amir Hossein Yazdavar, Krishnaprasad Thirunarayan, Amit P. Sheth, Gong Cheng 0001
IJCAI2
2014 Transmission of data with orthogonal frequency division multiplexing technique for communication networks using GHz frequency band soliton carrier
abstract
Microring resonators (MRRs) can be used to generate optical millimetre‐wave solitons with a broadband frequency of 40–60 GHz. Non‐linear light behaviours within MRRs, such as chaotic signals, can be used to generate logic codes (digital codes). The soliton signals can be multiplexed and modulated with the logic codes using an orthogonal frequency division multiplexing (OFDM) technique to transmit the data via a network system. OFDM uses overlapping subcarriers without causing inter‐carrier interference. It provides both a high data rate and symbol duration using frequency division multiplexing over multiple subcarriers within one channel. The results show that MRRs support both single‐carrier and multi‐carrier optical soliton pulses, which can be used in an OFDM based on whether fast Fourier transform or discrete wavelet transform transmission/receiver system. Localised ultra‐short soliton pulses within frequencies of 50 and 52 GHz can be seen at the throughput port of the panda system with respect to full‐width at half‐maximum (FWHM) and free spectrum range of 5 MHz and 2 GHz, respectively. The soliton pulses with FWHMs of 10 MHz could be generated at the drop port. Therefore, transmission of data information can be performed via a communication network using soliton pulse carriers and an OFDM technique.
Iraj Sadegh Amiri, Monireh Ebrahimi, Amir Hossein Yazdavar, S. Ghorbani, S. E. Alavi, Sevia Mahdaliza Idrus, J. Ali
IET Commun.3