Information Processing & Management最新文献

{"title":"A context-aware attention and graph neural network-based multimodal framework for misogyny detection","authors":"","doi":"10.1016/j.ipm.2024.103895","DOIUrl":"10.1016/j.ipm.2024.103895","url":null,"abstract":"<div><div>A substantial portion of offensive content on social media is directed towards women. Since the approaches for general offensive content detection face a challenge in detecting misogynistic content, it requires solutions tailored to address offensive content against women. To this end, we propose a novel multimodal framework for the detection of misogynistic and sexist content. The framework comprises three modules: the Multimodal Attention module (MANM), the Graph-based Feature Reconstruction Module (GFRM), and the Content-specific Features Learning Module (CFLM). The MANM employs adaptive gating-based multimodal context-aware attention, enabling the model to focus on relevant visual and textual information and generating contextually relevant features. The GFRM module utilizes graphs to refine features within individual modalities, while the CFLM focuses on learning text and image-specific features such as toxicity features and caption features. Additionally, we curate a set of misogynous lexicons to compute the misogyny-specific lexicon score from the text. We apply test-time augmentation in feature space to better generalize the predictions on diverse inputs. The performance of the proposed approach has been evaluated on two multimodal datasets, MAMI, and MMHS150K, with 11,000 and 13,494 samples, respectively. The proposed method demonstrates an average improvement of 11.87% and 10.82% in macro-F1 over existing multimodal methods on the MAMI and MMHS150K datasets, respectively.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002541/pdfft?md5=d17cb5e20a69f9c766570983bc722abc&pid=1-s2.0-S0306457324002541-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142314954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Multi-granularity contrastive zero-shot learning model based on attribute decomposition","authors":"","doi":"10.1016/j.ipm.2024.103898","DOIUrl":"10.1016/j.ipm.2024.103898","url":null,"abstract":"<div><p>Zero-shot learning (ZSL) aims to identify new classes by transferring semantic knowledge from seen classes to unseen classes. However, existing models lack a differentiated understanding of different attributes and ignore the impact of global context information. Therefore, we propose a multi-granularity contrastive zero-shot learning model based on attribute decomposition. Specifically, as attributes are the carriers of semantic knowledge, we first classify attributes into key attributes and common attributes, i.e., attribute decomposition, and the importance of common attributes is increased by key attribute mask prediction. Then, inspired by Navon’s global–local paradigm, we work out the multi-granularity contrastive learning model, which is composed of the global learning module and the local one, to further enhance the interaction between the global and local information. Finally, zero-shot image classification is achieved by training a multi-granularity contrastive learning model. The method is experimented on three public ZSL benchmark datasets (i.e., AWA2, CUB, and SUN). Compared with the existing model, this model improves the accuracy by 2.2%/5.4% (AWA2/SUN) on conventional ZSL, 2.5%/1.6%/6.3% (AWA2/CUB/SUN) on generalized ZSL, further verifying the effectiveness of this model.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002577/pdfft?md5=c22471566c970cb53ade37147177d34d&pid=1-s2.0-S0306457324002577-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142272048","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Asymmetric augmented paradigm-based graph neural architecture search","authors":"","doi":"10.1016/j.ipm.2024.103897","DOIUrl":"10.1016/j.ipm.2024.103897","url":null,"abstract":"<div><p>In most scenarios of graph-based tasks, graph neural networks (GNNs) are trained end-to-end with labeled samples. Labeling graph samples, a time-consuming and expert-dependent process, leads to huge costs. Graph data augmentations can provide a promising method to expand labeled samples cheaply. However, graph data augmentations will damage the capacity of GNNs to distinguish non-isomorphic graphs during the supervised graph representation learning process. How to utilize graph data augmentations to expand labeled samples while preserving the capacity of GNNs to distinguish non-isomorphic graphs is a challenging research problem. To address the above problem, we abstract a novel asymmetric augmented paradigm in this paper and theoretically prove that it offers a principled approach. The asymmetric augmented paradigm can preserve the capacity of GNNs to distinguish non-isomorphic graphs while utilizing augmented labeled samples to improve the generalization capacity of GNNs. To be specific, the asymmetric augmented paradigm will utilize similar yet distinct asymmetric weights to classify the real sample and augmented sample, respectively. To systemically explore the benefits of asymmetric augmented paradigm under different GNN architectures, rather than studying individual asymmetric augmented GNN (A²GNN) instance, we then develop an auto-search engine called <strong>A</strong>symmetric <strong>A</strong>ugmented <strong>G</strong>raph <strong>N</strong>eural <strong>A</strong>rchitecture <strong>S</strong>earch (A²GNAS) to save human efforts. We empirically validate our asymmetric augmented paradigm on multiple graph classification benchmarks, and demonstrate that representative A²GNN instances automatically discovered by our A²GNAS method achieve state-of-the-art performance compared with competitive baselines. Our codes are available at: <span><span>https://github.com/csubigdata-Organization/A2GNAS</span><svg><path></path></svg></span>.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002565/pdfft?md5=9b952876a2a78b6f526e18f25fd5b60e&pid=1-s2.0-S0306457324002565-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142271946","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Are Multiple information sources better? The effect of multiple physicians in online medical teams on patient satisfaction","authors":"","doi":"10.1016/j.ipm.2024.103889","DOIUrl":"10.1016/j.ipm.2024.103889","url":null,"abstract":"<div><p>An emerging service model in online health communities (OHCs) is that of medical teams comprising multiple physicians who collaborate to offer diagnoses and recommendations to patients. Given its multiple information sources, this model has the potential to deliver high-quality services and enhance patient satisfaction. However, the effect of a wider range of information on patient satisfaction has yet to be empirically examined. Therefore, the current research aims to examine the effect of multiple sources of health-related information on the satisfaction of patients in OHCs. We construct a sample model and empirically test it using a dataset comprising 115,367 consultation records sourced from WeDoctor. The results show that responses from multiple physicians in OHC medical teams increase patient satisfaction. In addition, we explore the moderating effects of team composition and team replies. The results show that physicians with higher titles and affiliations with the same department and the same question's replies from multiple physicians all play a positive moderating role, while reply time plays a negative moderating role. This research enriches the existing literature by focusing on patient satisfaction in the context of OHCs and offers recommendations for research and practice.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002486/pdfft?md5=ada04d837fdffa5a217927ee41d3b329&pid=1-s2.0-S0306457324002486-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142243076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Feature enhancement based on hierarchical reconstruction framework for inductive prediction on sparse graphs","authors":"","doi":"10.1016/j.ipm.2024.103894","DOIUrl":"10.1016/j.ipm.2024.103894","url":null,"abstract":"<div><p>Knowledge graph completion aims to infer the missing links of new elements, however, the missing links often lie in sparse regions of the graph. Primary subgraph-based methods rely heavily on structural information, which makes it difficult for them to play an essential role in sparse graph completion. To address this challenge, we propose a learning framework for feature-enhanced hierarchical reconstruction (FEHR). The proposed FEHR explores relational semantics at the global and local levels, minimizing the limitations of sparse structures. First, entity graphs are converted into relation graphs, and overreliance on the entity structure is reduced by obtaining prior knowledge on similar global graphs. Second, the relational features are further refined at the local level. Finally, an improved performer model expresses the degree of preference between the predicted behaviors and relations. Extensive inductive experiments showed that FEHR performs better than state-of-the-art baselines, achieving improvements in area under the prediction–recall curve (AUC-PR) and Hits@n metrics, ranging from 0.32% to 11.73%.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S030645732400253X/pdfft?md5=fab4be9f1bbace870e6db64d841a97c9&pid=1-s2.0-S030645732400253X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142243075","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The use of convolutional neural networks for abnormal behavior recognition in crowd scenes","authors":"","doi":"10.1016/j.ipm.2024.103880","DOIUrl":"10.1016/j.ipm.2024.103880","url":null,"abstract":"<div><p>This study introduces the Abnormality Converging Scene Analysis Method (ACSAM) to detect abnormal group behavior using monitored videos or CCTV images in crowded scenarios. Abnormal behavior recognition involves classifying activities and gestures in continuous scenes, which traditionally presents significant computational challenges, particularly in complex crowd scenes, leading to reduced recognition accuracy. To address these issues, ACSAM employs a convolutional neural network (CNN) enhanced with Abnormality and Crowd Behavior Training layers to accurately detect and classify abnormal activities, regardless of crowd density. The method involves extracting frames from the input scene and using CNN to perform conditional validation of abnormality factors, comparing current values with previous high values to maximize detection accuracy. As the abnormality factor increases, the identification rate improves with higher training iterations. The system was tested on 26 video samples and trained on 34 samples, demonstrating superior performance to other approaches like DeepROD, MSI-CNN, and PT-2DCNN. Specifically, ACSAM achieved a 12.55% improvement in accuracy, a 12.97% increase in recall, and a 10.23% enhancement in convergence rate. These results suggest that ACSAM effectively overcomes the computational challenges inherent in crowd scene detection, offering a robust solution for real-time abnormal behavior recognition in crowded environments.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002395/pdfft?md5=1db6d11ff866a167a1abef7ca8f5215c&pid=1-s2.0-S0306457324002395-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142162322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Forecasting time to risk based on multi-party data: An explainable privacy-preserving decentralized survival analysis method","authors":"","doi":"10.1016/j.ipm.2024.103881","DOIUrl":"10.1016/j.ipm.2024.103881","url":null,"abstract":"<div><p>Forecasting time-to-risk poses a challenge in the information processing and risk management within financial markets. While previous studies have focused on centralized survival analysis, how to forecast the time to risk using multi-party data in a decentralized and privacy-preserving setting with the requirements of explainability and mitigating information redundancy is still challenging. To this end, we propose an explainable, privacy-preserving, decentralized survival analysis method. Specifically, we transform time-to-risk forecasting into a multi-label learning problem by independently modeling for multiple time horizons. For each forecasting time horizon, we use Taylor expansion and homomorphic encryption to securely build a decentralized logistic regression model. Considering the information redundancy among multiple parties, we design and add decentralized regularizations to each model. We also propose a decentralized proximal gradient descent method to estimate the decentralized coefficients. Empirical evaluation shows that the proposed method yields competitive forecasting performance and explainable results as compared to benchmarked methods.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002401/pdfft?md5=17e60030bf2b1bfc21c31cf4d9f359d8&pid=1-s2.0-S0306457324002401-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142162321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"EvolveDetector: Towards an evolving fake news detector for emerging events with continual knowledge accumulation and transfer","authors":"","doi":"10.1016/j.ipm.2024.103878","DOIUrl":"10.1016/j.ipm.2024.103878","url":null,"abstract":"<div><p>The prevalence of fake news on social media poses devastating and wide-ranging threats to political beliefs, economic activities, and public health. Due to the continuous emergence of news events on social media, the corresponding data distribution keeps changing, which places high demands on the generalizabilities of automatic detection methods. Current cross-event fake news detection methods often enhance generalization by training models on a broad range of events. However, they require storing historical training data and retraining the model from scratch when new events occur, resulting in substantial storage and computational costs. This limitation makes it challenging to meet the requirements of continual fake news detection on social media. Inspired by human abilities to consolidate learning from earlier tasks and transfer knowledge to new tasks, in this paper, we propose a fake news detection method based on parameter-level historical event knowledge transfer, namely EvolveDetector, which does not require storing historical event data to retrain the model from scratch. Specifically, we design the hard attention-based knowledge storing mechanism to efficiently store the knowledge of learned events, which mainly consists of a knowledge memory and corresponding event masks. Whenever a new event needs to be detected for fake news, EvolveDetector retrieves the neuron parameters of all similar historical events from the knowledge memory to guide the learning in the new event. Afterward, the multi-head self-attention is used to integrate the feature outputs corresponding to these similar events to train a classifier for the new event. Experiments on public datasets collected from Twitter and Sina Weibo demonstrate that our EvolveDetector outperforms state-of-the-art baselines, which can be utilized for cross-event fake news detection.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002371/pdfft?md5=a533d4b21ca6d972ae0c325e125eecb0&pid=1-s2.0-S0306457324002371-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142150504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The more quality information the better: Hierarchical generation of multi-evidence alignment and fusion model for multimodal entity and relation extraction","authors":"","doi":"10.1016/j.ipm.2024.103875","DOIUrl":"10.1016/j.ipm.2024.103875","url":null,"abstract":"<div><p>Multimodal Entity and Relation Extraction (MERE) encompasses tasks, including Multimodal Named Entity Recognition (MNER) and Multimodal Relation Extraction (MRE), aiming to extract valuable information from environments rich in multimodal data. Currently, many research endeavors face various challenges, including the insufficient utilization of emotional information in multimodal data, mismatches between textual and visual content, ambiguous meanings, and difficulties achieving precise alignment across different semantic levels. To address these issues, we propose the <strong>H</strong>ierarchical <strong>G</strong>eneration of <strong>M</strong>ulti Evidence <strong>A</strong>lignment <strong>F</strong>usion Model for Multimodal Entity and Relation Extraction (HGMAF). This model comprises a hierarchical diffusion semantic generation stage and a multi-evidence alignment fusion module. Initially, we designed different prompt templates for the original text, using the Large Language Model (LLM) to generate corresponding hierarchical textual content. Subsequently, the generated hierarchical content is diffused to obtain images with rich hierarchical semantic information. This stage contributes to enhancing the model's understanding of hierarchical information in the original content. Following this, we design the multi-evidence alignment fusion module, which combines the generated textual and image evidence, fully leveraging information from different sources to improve extraction accuracy. Experimental results demonstrate that our model achieves F1 scores of 76.29 %, 87.66 %, and 87.34 % on the Twitter2015, Twitter2017, and MNRE datasets, respectively. These results surpass the previous state-of-the-art models by 0.29 %, 0.1 %, and 2.77 %. Furthermore, our model demonstrates superior performance in low-resource scenarios, confirming its effectiveness. The related code can be found at <span><span>https://github.com/lsx314/HGMAF</span><svg><path></path></svg></span>.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002346/pdfft?md5=e619cd49017958045ad28bee7549ebe9&pid=1-s2.0-S0306457324002346-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142150505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Privacy-preserving cancelable multi-biometrics for identity information management","authors":"","doi":"10.1016/j.ipm.2024.103869","DOIUrl":"10.1016/j.ipm.2024.103869","url":null,"abstract":"<div><p>Biometrics have copious merits over traditional authentication schemes and promote information management. The demand for large-scale biometric identification and certification booms. In spite of enhanced efficiency and scalability in cloud-based biometrics, they suffer from compromised privacy during the transmission and storage of irrevocable biometric information. Existing biometric protection strategies fatally degrade the recognition performance, due to two folds: inherent drawbacks of uni-biometrics and inevitable information loss caused by over-protection. Hence, how to make a trade-off between performance and protection is an alluring challenge. To settle these issues, we are the first to present a cancelable multi-biometric system combining iris and periocular traits with recognition performance improved and privacy protection emphasized. Our proposed binary mask-based cross-folding integrates multi-instance and multi-modal fusion tactics. Further, the steganography based on a low-bit strategy conceals sensitive biometric fusion into QR code with transmission imperceptible. Subsequently, a fine-grained hybrid attention dual-path network through stage-wise training models inter-class separability and intra-class compactness to extract more discriminative templates for biometric fusion. Afterward, the random graph neural network transforms the template into the protection domain to generate the cancelable template versus the malicious. Experimental results on two benchmark datasets, namely IITDv1 and MMUv1, show the proposed algorithm attains promising performance against state-of-the-art approaches in terms of equal error rate. What is more, extensive privacy analysis demonstrates prospective irreversibility, unlinkability, and revocability, respectively.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002280/pdfft?md5=87f9f84ab6482d7e4ed90cf98d904c9b&pid=1-s2.0-S0306457324002280-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142150503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}