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

Pongsakorn Jirachanchaisiri

dblp:251/1627 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2026
0000-0002-8909-8336ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
Recommender systems · 100%
Artificial intelligence
1 paper
Transfer learning and domain adaptation · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
cross-domain recommendation
1.012026
DDIREC: Domain-Disentanglement on Item Representations for Cross-Domain Recommendation · WSDM 2026
Recommender systems › representation learning for recommendation
item representation learning
1.012026
DDIREC: Domain-Disentanglement on Item Representations for Cross-Domain Recommendation · WSDM 2026
Machine learning › Transfer learning and domain adaptation
cross-domain transfer
0.312026
DDIREC: Domain-Disentanglement on Item Representations for Cross-Domain Recommendation · WSDM 2026

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

domain disentanglement · 2.0
YearPublicationVenuePosition
2026 DDIREC: Domain-Disentanglement on Item Representations for Cross-Domain Recommendation
Pongsakorn Jirachanchaisiri, Saranya Maneeroj, Atsuhiro Takasu
WSDM1
2025 TRH2TQA: Table Recognition with Hierarchical Relationships to Table Question-Answering on Business Table Images
abstract
Despite advancements in visual question answering, challenges persist with documents like financial reports, often structured in complicated tabular structures with complex numerical computations. An alternative approach, the pipeline-driven methodology, includes table recognition (TR) and table question-answering (TQA). Recent advancements in TR support this approach with better accuracy and interpretability. However, real-world tables usually represent hierarchical tables. They pose additional challenges due to merged cells and indents, necessitating a specific approach for hierarchical relationship extraction. In this paper, we propose TRH2TQA (Table Recognition with Hierarchical Relationships to Table Question-Answering) for business table images. It consists of three modules on table images with question-answer pairs. First, the TR module extracts structure and textual content from table images into HTML format. Second, post-structure extraction is applied to identify header and hierarchical relationships using predicted column span and bounding box. Finally, this information is combined with natural language questions in the TQA module to generate the answer through the decoder. In extensive experiments, TRH2TQA outperforms in questionanswering performance on the VQAonBD 2023 dataset.
Pongsakorn Jirachanchaisiri, Nam Tuan Ly, Atsuhiro Takasu
WACV1
2025 COLANet: Cross-Domain Recommender Systems with Latent Overlapping Items on Graph Neural Networks
abstract
Cross-domain recommender systems (CDRSs) enhance recommendations by transferring knowledge of overlapping users across two domains. Deep canonical correlation analysis (DCCA) shows promising results in CDRSs by maximizing correlations between representations of overlapping users, enabling cross-domain knowledge transfer that depends on the degree of relationship between domains. As a result, DCCA selectively shares only relevant knowledge, alleviating the problem of noisy representation found in traditional CDRSs, where they transfer knowledge regardless of the correlation strength between domains. Although DCCA is used for user transfer, item transfer, referring to the transfer of explicit knowledge of the same items between domains, is impossible due to the absence of overlapping items to facilitate direct knowledge transfer. Meanwhile, graph neural networks (GNNs) embed users and items from separate user and item graphs in each domain. Therefore, better representations are obtained from captured complex relationships and collaborative signals. To construct graphs of overlapping items, latent linkages among items between domains could be discovered by the neural topic model (NTM), forming new graphs representing the latent relationships. Therefore, COLANet, a GNN-based CDRS, is proposed to solve the DCCA limitation on item transfer by proposing the extraction of item representations that do not exist in another domain using latent characteristics. First, user-user graphs are constructed using user similarity, and the item-topic graph is constructed using latent topics learned from item descriptions with NTM. Hence, user and item graphs of each domain are constructed separately, preventing domain relationship misalignment. Second, these graphs are fed to GNN to obtain user and item representations. Third, these representations are fed to DCCA to transfer knowledge between user-user and item-item. Finally, correlated user and item representations of each domain are used to predict ratings. The experiments demonstrate that COLANet outperforms the baselines across four pairs of domains, including both similar and different domains.
Pongsakorn Jirachanchaisiri, Saranya Maneeroj, Atsuhiro Takasu
ACM Trans. Knowl. Discov. Data1