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

Saeed Najafipour Najafipour

dblp:381/6124 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

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

Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

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
Web and social media mining · 50% Knowledge graphs · 50%
Artificial intelligence
1 paper
Graph learning · 100%

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

TopicWeightPapersLastEvidence papers
Web and social media mining › user identity linkage
author linking
0.812024
Short-Text Author Linking Through Multi-Facet Temporal-Textual Embedding (Extended Abstract) · ICDE 2024
Machine learning › Graph learning
network embedding
0.212024
Short-Text Author Linking Through Multi-Facet Temporal-Textual Embedding (Extended Abstract) · ICDE 2024

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

neural network · 1.5multi-aspect vector space model · 1.5graph cutting · 1.5
YearPublicationVenuePosition
2024 Short-Text Author Linking Through Multi-Facet Temporal-Textual Embedding (Extended Abstract)
abstract
We devise a neural network-based temporal-textual framework that generates subgraphs with highly correlated authors from short-text contents. Our approach computes the relevance score (edge weight) between authors by considering a portmanteau of contents and concepts. It then employs a stack-wise graph-cutting algorithm to extract communities of related authors. Experimental results show that our multi-aspect vector space model can gain higher performance than other knowledge-centered competitors in linking short-text authors.
Saeed Najafipour Najafipour, Saeid Hosseini, Wen Hua, Mohammadreza Kangavari, Xiaofang Zhou 0001
ICDE1