Multimodal Summarization aims to use multimodal data to generate accurate and concise summaries for long sentences. While previous work has achieved promising success, they have overlooked the mismatching among multimodal semantics and lacked subject information guidance for adaptive referential images. Motivated by this observation, we propose ASSM, anAdaptiveSubject-focused modeling for multimodal summarization viaSemanticMatching. The novelty of ASSM lies in two aspects. First, we propose a multimodal semantic matching module that projects multimodal inputs into a shared joint embedding semantic space to determine whether the semantics between multimodalities are mismatching. Second, we propose an adaptive subject-focused guide module, which adaptively references images to learn subject tokens based on the multimodal semantic matching results. With these subject tokens, we are able to focus on the subject information, providing precise guidance for summary generation. We conduct extensive experiments on two standard benchmarks and compare ASSM with 17 existing models. The experimental results regarding ROUGE, BERTScore, and MoverScore show that the proposed ASSM model outperforms all competitors, achieving state-of-the-art performance and suggesting the effectiveness of our proposal. In addition, we provide a case study to further demonstrate the usability of ASSM.

The fairness and bias of spectral clustering algorithms have attracted considerable research interest in recent years. Currently fair spectral clustering algorithms are based on the notions of group fairness and individual fairness, which effectively reduce decision bias for similar individuals and sensitive groups. Existing fair spectral clustering algorithms achieve a certain degree of resource redistribution during the clustering process for a particular individual or part of a group, but there is still a situation where the final decision is unfair to the oversized or undersized result clusters. To this end, we present the first principled study of Scale Fairness on Spectral Clustering and propose the SFSC algorithm, which aims to effectively reduce the possibility of the results being oversized or undersized clusters by introducing entropy computation into the spectral clustering process. We measure the scale fairness of clusters by two statistical metrics, and demonstrate on eight classical and real-world datasets that SFSC has better fairness performance compared to spectral clustering while having comparable clustering effect. To the best of our knowledge, this paper is the first study to propose scale fairness for spectral clustering.

Most Web pages contain temporal information, which can be utilized by search engines to improve searching performance for users. However, traditional search engines have little support in processing temporal-textual Web queries. Aiming at solving this problem, in this paper we present and implement a prototype system for time-sensitive queries, which is called TASE (Time-Aware Search Engine). TASE extracts both the explicit and implicit temporal expressions for each Web page, and calculates the relevant score between the Web page and each temporal expression, and then re-rank search results based on the temporal-textual relevance between Web pages and the queries. It is demonstrated that TASE can improve the effectiveness of temporal-textual Web queries.