Umeå University's logo

umu.sePublications
System disruptions
We are currently experiencing disruptions on the search portals due to high traffic. We are working to resolve the issue, you may temporarily encounter an error message.
Change search
Link to record
Permanent link

Direct link
Publications (10 of 37) Show all publications
Ming, H., Yang, J., Liu, S., Jiang, L. & An, N. (2025). Mitigating prototype shift: few-shot nested named entity recognition with prototype-attention contrastive learning. Expert systems with applications, 268, Article ID 126293.
Open this publication in new window or tab >>Mitigating prototype shift: few-shot nested named entity recognition with prototype-attention contrastive learning
Show others...
2025 (English)In: Expert systems with applications, ISSN 0957-4174, E-ISSN 1873-6793, Vol. 268, article id 126293Article in journal (Refereed) Published
Abstract [en]

Nested entities are prone to obtain similar representations in pre-trained language models, posing challenges for Named Entity Recognition (NER), especially in the few-shot setting where prototype shifts often occur due to distribution differences between the support and query sets. In this paper, we regard entity representation as the combination of prototype and non-prototype representations. With a hypothesis that using the prototype representation specifically can help mitigate potential prototype shifts, we propose a Prototype-Attention mechanism in the Contrastive Learning framework (PACL) for the few-shot nested NER. PACL first generates prototype-enhanced span representations to mitigate the prototype shift by applying a prototype attention mechanism. It then adopts a novel prototype-span contrastive loss to reduce prototype differences further and overcome the O-type's non-unique prototype limitation by comparing prototype-enhanced span representations with prototypes and original semantic representations. Our experiments show that the PACL outperformed baseline models on the 1-shot and 5-shot tasks in terms of F1 score. Further analyses indicate that our Prototype-Attention mechanism is a simple but effective method and exhibits good generalizability.

Place, publisher, year, edition, pages
Elsevier, 2025
Keywords
Few-shot, Nested named entity recognition, Prototype shift
National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-234004 (URN)10.1016/j.eswa.2024.126293 (DOI)2-s2.0-85214193130 (Scopus ID)
Funder
The Swedish Foundation for International Cooperation in Research and Higher Education (STINT), MG2020-8848
Available from: 2025-01-15 Created: 2025-01-15 Last updated: 2025-01-15Bibliographically approved
Wang, D., Jiang, L., Kjellander, M., Weidemann, E., Trygg, J. & Tysklind, M. (2024). A novel data mining framework to investigate causes of boiler failures in waste-to-energy plants. Processes, 12(7), Article ID 1346.
Open this publication in new window or tab >>A novel data mining framework to investigate causes of boiler failures in waste-to-energy plants
Show others...
2024 (English)In: Processes, ISSN 2227-9717, Vol. 12, no 7, article id 1346Article in journal (Refereed) Published
Abstract [en]

Examining boiler failure causes is crucial for thermal power plant safety and profitability. However, traditional approaches are complex and expensive, lacking precise operational insights. Although data-driven approaches hold substantial potential in addressing these challenges, there is a gap in systematic approaches for investigating failure root causes with unlabeled data. Therefore, we proffered a novel framework rooted in data mining methodologies to probe the accountable operational variables for boiler failures. The primary objective was to furnish precise guidance for future operations to proactively prevent similar failures. The framework was centered on two data mining approaches, Principal Component Analysis (PCA) + K-means and Deep Embedded Clustering (DEC), with PCA + K-means serving as the baseline against which the performance of DEC was evaluated. To demonstrate the framework’s specifics, a case study was performed using datasets obtained from a waste-to-energy plant in Sweden. The results showed the following: (1) The clustering outcomes of DEC consistently surpass those of PCA + K-means across nearly every dimension. (2) The operational temperature variables T-BSH3rm, T-BSH2l, T-BSH3r, T-BSH1l, T-SbSH3, and T-BSH1r emerged as the most significant contributors to the failures. It is advisable to maintain the operational levels of T-BSH3rm, T-BSH2l, T-BSH3r, T-BSH1l, T-SbSH3, and T-BSH1r around 527 °C, 432 °C, 482 °C, 338 °C, 313 °C, and 343 °C respectively. Moreover, it is crucial to prevent these values from reaching or exceeding 594 °C, 471 °C, 537 °C, 355 °C, 340 °C, and 359 °C for prolonged durations. The findings offer the opportunity to improve future operational conditions, thereby extending the overall service life of the boiler. Consequently, operators can address faulty tubes during scheduled annual maintenance without encountering failures and disrupting production.

Place, publisher, year, edition, pages
MDPI, 2024
Keywords
data mining, deep embedded clustering, failure analysis, power plants
National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-228513 (URN)10.3390/pr12071346 (DOI)001277572100001 ()2-s2.0-85199646373 (Scopus ID)
Available from: 2024-08-19 Created: 2024-08-19 Last updated: 2024-08-19Bibliographically approved
Ming, H., Yang, J., Gui, F., Jiang, L. & An, N. (2024). Few-shot nested named entity recognition. Knowledge-Based Systems, 293, Article ID 111688.
Open this publication in new window or tab >>Few-shot nested named entity recognition
Show others...
2024 (English)In: Knowledge-Based Systems, ISSN 0950-7051, E-ISSN 1872-7409, Vol. 293, article id 111688Article in journal (Refereed) Published
Abstract [en]

While Named Entity Recognition (NER) is a widely studied task, making inferences of entities with only a few labeled data has been challenging, especially for entities with nested structures commonly existing in NER datasets. Unlike flat entities, entities and their nested entities are more likely to have similar semantic feature representations, drastically increasing difficulties in classifying different entity categories. This paper posits that the few-shot nested NER task warrants its own dedicated attention and proposes a Global-Biaffine Positive-Enhanced (GBPE) framework for this new task. Within the GBPE framework, we first develop the new Global-Biaffine span representation to capture the span global dependency information for each entity span to distinguish nested entities. We then formulate a unique positive-enhanced contrastive loss function to enhance the utility of specific positive samples in contrastive learning for larger margins. Lastly, by using these enlarged margins, we obtain better margin constraints and incorporate them into the nearest neighbor inference to predict the unlabeled entities. Extensive experiments on three nested NER datasets in English, German, and Russian show that GBPE outperforms baseline models on the 1-shot and 5-shot tasks in terms of F1 score.

Place, publisher, year, edition, pages
Elsevier, 2024
Keywords
Few-shot, Nested named entity recognition, Positive-enhanced contrastive loss
National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-223235 (URN)10.1016/j.knosys.2024.111688 (DOI)2-s2.0-85189309268 (Scopus ID)
Funder
The Swedish Foundation for International Cooperation in Research and Higher Education (STINT), MG2020-8848
Available from: 2024-04-19 Created: 2024-04-19 Last updated: 2024-04-19Bibliographically approved
Yang, J., Zhu, Z., Ming, H., Jiang, L. & An, N. (2024). LPNER: label prompt for few-shot nested named entity recognition. In: Vu Nguyen; Hsuan-Tien Lin (Ed.), Asian Conference on Machine Learning: 5-8 December 2024, Hanoi, Vietnam. Paper presented at 16th Asian Conference on Machine Learning, ACML 2024, Hanoi, Vietnam, December 5-8, 2024 (pp. 781-796). ML Research Press
Open this publication in new window or tab >>LPNER: label prompt for few-shot nested named entity recognition
Show others...
2024 (English)In: Asian Conference on Machine Learning: 5-8 December 2024, Hanoi, Vietnam / [ed] Vu Nguyen; Hsuan-Tien Lin, ML Research Press , 2024, p. 781-796Conference paper, Published paper (Refereed)
Abstract [en]

Few-shot Named Entity Recognition (NER) aims to identify named entities using very little annotated data. Recently, prompt-based few-shot NER methods have demonstrated significant effectiveness. However, most existing methods employ multi-round prompts, which significantly increase time and computational costs. Furthermore, current single-round prompt methods are mainly designed for flat NER tasks and are not effective in handling nested NER tasks. Additionally, these methods do not to fully utilize the semantic information of entity labels through prompts. To address these challenges, we propose a novel Label-Prompt-based few-shot nested NER method named LPNER, which not only handles nested NER tasks but also efficiently extracts semantic information of entities through label prompts, thereby achieving more efficient and accurate NER. LPNER first designs a specialized prompt based on a span strategy to enhance label semantics and effectively combines multiple span representations using special mark to obtain enhanced span representations integrated with label semantics. Then, entity prototypes are constructed through prototype network for classifying candidate entity spans. We conducted extensive experiments on five nested datasets: ACE04, ACE05, GENIA, GermEval, and NEREL. In 1-shot and 5-shot tasks, LPNER’s F1 scores mostly outperform baseline models.

Place, publisher, year, edition, pages
ML Research Press, 2024
Series
Proceedings of Machine Learning Research, E-ISSN 2640-3498 ; 260
Keywords
Few-shot learning, Label semantics, Nested named recognition, Prompt learning
National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-236501 (URN)2-s2.0-85219527546 (Scopus ID)
Conference
16th Asian Conference on Machine Learning, ACML 2024, Hanoi, Vietnam, December 5-8, 2024
Available from: 2025-03-18 Created: 2025-03-18 Last updated: 2025-03-18Bibliographically approved
Tran, K.-T., Hy, T. S., Jiang, L. & Vu, X.-S. (2024). MGLEP: multimodal graph learning for modeling emerging pandemics with big data. Scientific Reports, 14(1), Article ID 16377.
Open this publication in new window or tab >>MGLEP: multimodal graph learning for modeling emerging pandemics with big data
2024 (English)In: Scientific Reports, E-ISSN 2045-2322, Vol. 14, no 1, article id 16377Article in journal (Refereed) Published
Abstract [en]

Accurate forecasting and analysis of emerging pandemics play a crucial role in effective public health management and decision-making. Traditional approaches primarily rely on epidemiological data, overlooking other valuable sources of information that could act as sensors or indicators of pandemic patterns. In this paper, we propose a novel framework, MGLEP, that integrates temporal graph neural networks and multi-modal data for learning and forecasting. We incorporate big data sources, including social media content, by utilizing specific pre-trained language models and discovering the underlying graph structure among users. This integration provides rich indicators of pandemic dynamics through learning with temporal graph neural networks. Extensive experiments demonstrate the effectiveness of our framework in pandemic forecasting and analysis, outperforming baseline methods across different areas, pandemic situations, and prediction horizons. The fusion of temporal graph learning and multi-modal data enables a comprehensive understanding of the pandemic landscape with less time lag, cheap cost, and more potential information indicators.

Place, publisher, year, edition, pages
Springer Nature, 2024
National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-227969 (URN)10.1038/s41598-024-67146-y (DOI)39013976 (PubMedID)2-s2.0-85198649048 (Scopus ID)
Funder
The Swedish Foundation for International Cooperation in Research and Higher Education (STINT), MG2020-8848Knut and Alice Wallenberg Foundation
Available from: 2024-07-23 Created: 2024-07-23 Last updated: 2024-07-23Bibliographically approved
Jiang, L. & Torra, V. (2023). Data protection and multi-database data-driven models. Future Internet, 15(3), Article ID 93.
Open this publication in new window or tab >>Data protection and multi-database data-driven models
2023 (English)In: Future Internet, E-ISSN 1999-5903, Vol. 15, no 3, article id 93Article in journal (Refereed) Published
Abstract [en]

Anonymization and data masking have effects on data-driven models. Different anonymization methods have been developed to provide a good trade-off between privacy guarantees and data utility. Nevertheless, the effects of data protection (e.g., data microaggregation and noise addition) on data integration and on data-driven models (e.g., machine learning models) built from these data are not known. In this paper, we study how data protection affects data integration, and the corresponding effects on the results of machine learning models built from the outcome of the data integration process. The experimental results show that the levels of protection that prevent proper database integration do not affect machine learning models that learn from the integrated database to the same degree. Concretely, our preliminary analysis and experiments show that data protection techniques have a lower level of impact on data integration than on machine learning models.

Place, publisher, year, edition, pages
MDPI, 2023
Keywords
anonymization, data integration, data protection, masking
National Category
Computer Sciences Computer Systems
Identifiers
urn:nbn:se:umu:diva-206361 (URN)10.3390/fi15030093 (DOI)000956593800001 ()2-s2.0-85150888833 (Scopus ID)
Available from: 2023-04-26 Created: 2023-04-26 Last updated: 2023-08-03Bibliographically approved
Vu, X.-S., Tran, S. N. & Jiang, L. (2023). dpUGC: learn differentially private representation for user generated contents. In: Alexander Gelbukh (Ed.), Computational linguistics and intelligent text processing: 20th international conference, CICLing 2019, La Rochelle, France, April 7–13, 2019, revised selected papers, part I. Paper presented at 20th International Conference on Computational Linguistics and Intelligent Text Processing, La Rochelle, France, April 7-13, 2019. (pp. 316-331). Springer, 13451
Open this publication in new window or tab >>dpUGC: learn differentially private representation for user generated contents
2023 (English)In: Computational linguistics and intelligent text processing: 20th international conference, CICLing 2019, La Rochelle, France, April 7–13, 2019, revised selected papers, part I / [ed] Alexander Gelbukh, Springer, 2023, Vol. 13451, p. 316-331Conference paper, Published paper (Refereed)
Abstract [en]

This paper firstly proposes a simple yet efficient generalized approach to apply differential privacy to text representation (i.e., word embedding). Based on it, we propose a user-level approach to learn personalized differentially private word embedding model on user generated contents (UGC). To our best knowledge, this is the first work of learning user-level differentially private word embedding model from text for sharing. The proposed approaches protect the privacy of the individual from re-identification, especially provide better trade-off of privacy and data utility on UGC data for sharing. The experimental results show that the trained embedding models are applicable for the classic text analysis tasks (e.g., regression). Moreover, the proposed approaches of learning differentially private embedding models are both framework- and dataindependent, which facilitates the deployment and sharing. The source code is available at https://github.com/sonvx/dpText.

Place, publisher, year, edition, pages
Springer, 2023
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 13451
Keywords
Private word embedding, Differential privacy, UGC
National Category
Natural Language Processing
Identifiers
urn:nbn:se:umu:diva-160887 (URN)10.1007/978-3-031-24337-0_23 (DOI)2-s2.0-85149907226 (Scopus ID)978-3-031-24336-3 (ISBN)978-3-031-24337-0 (ISBN)
Conference
20th International Conference on Computational Linguistics and Intelligent Text Processing, La Rochelle, France, April 7-13, 2019.
Note

Originally included in thesis in manuscript form. 

Available from: 2019-06-25 Created: 2019-06-25 Last updated: 2025-02-07Bibliographically approved
Pan, Y., Yang, J., Ming, H., Jiang, L. & An, N. (2023). Few-shot named entity recognition via Label-Attention Mechanism. In: ICCAI '23: proceedings of the 2023 9th international conference on computing and artificial intelligence. Paper presented at 9th International Conference on Computing and Artificial Intelligence, ICCAI 2023, Tianjin, China, March 17-20, 2023 (pp. 466-471). Association for Computing Machinery (ACM)
Open this publication in new window or tab >>Few-shot named entity recognition via Label-Attention Mechanism
Show others...
2023 (English)In: ICCAI '23: proceedings of the 2023 9th international conference on computing and artificial intelligence, Association for Computing Machinery (ACM), 2023, p. 466-471Conference paper, Published paper (Refereed)
Abstract [en]

Few-shot named entity recognition aims to identify specific words with the support of very few labeled entities. Existing transfer-learning-based methods learn the semantic features of words in the source domain and migrate them to the target domain but ignore the different label-specific information. We propose a novel Label-Attention Mechanism (LAM) to utilize the overlooked label-specific information. LAM can separate label information from semantic features and learn how to obtain label information from a few samples through the meta-learning strategy. When transferring to the target domain, LAM replaces the source label information with the knowledge extracted from the target domain, thus improving the migration ability of the model. We conducted extensive experiments on multiple datasets, including OntoNotes, CoNLL'03, WNUT'17, GUM, and Few-Nerd, with two experimental settings. The results show that LAM is 7% better than the state-of-the-art baseline models by the absolute F1 scores.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2023
Series
ACM International Conference Proceeding Series
Keywords
Few shot learning, Label-Attention, Named Entity Recognition
National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-213934 (URN)10.1145/3594315.3594358 (DOI)2-s2.0-85168240049 (Scopus ID)9781450399029 (ISBN)
Conference
9th International Conference on Computing and Artificial Intelligence, ICCAI 2023, Tianjin, China, March 17-20, 2023
Available from: 2023-09-11 Created: 2023-09-11 Last updated: 2023-09-11Bibliographically approved
Brännström, M., Jiang, L., Aler Tubella, A. & Dignum, V. (2023). Impact based fairness framework for socio-technical decision making. In: Roberta Calegari; Andrea Aler Tubella; Gabriel González Castañe; Virginia Dignum; Michela Milano (Ed.), Proceedings of the 1st workshop on fairness and bias in AIco-located with 26th european conference on artificial intelligence (ECAI 2023): . Paper presented at 1st Workshop on Fairness and Bias in AI, AEQUITAS 2023, Krakow, 1 October, 2023.. CEUR-WS
Open this publication in new window or tab >>Impact based fairness framework for socio-technical decision making
2023 (English)In: Proceedings of the 1st workshop on fairness and bias in AIco-located with 26th european conference on artificial intelligence (ECAI 2023) / [ed] Roberta Calegari; Andrea Aler Tubella; Gabriel González Castañe; Virginia Dignum; Michela Milano, CEUR-WS , 2023Conference paper, Published paper (Refereed)
Abstract [en]

Avoiding bias and understanding the consequences of artificial intelligence used in decision making is of high importance to avoid mistreatment and unintended harm. This paper aims to present an impact focused approach to model the information flow of a socio-technical decision system for analysis of bias and fairness. The framework roots otherwise abstract technical accuracy and bias measures in stakeholder effects and forms a scaffold around which further analysis of the socio-technical system and its components can be coordinated. Two example use-cases are presented and analysed.

Place, publisher, year, edition, pages
CEUR-WS, 2023
Series
CEUR Workshop Proceedings, ISSN 16130073 ; 3523
Keywords
decision-making system, Fairness, information-flow, socio-technical factors
National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-217267 (URN)2-s2.0-85177071301 (Scopus ID)
Conference
1st Workshop on Fairness and Bias in AI, AEQUITAS 2023, Krakow, 1 October, 2023.
Funder
EU, Horizon 2020, 101070363
Available from: 2023-11-29 Created: 2023-11-29 Last updated: 2023-11-30Bibliographically approved
Vu, X.-S. & Jiang, L. (2023). Self-adaptive privacy concern detection for user-generated content. In: Alexander Gelbukh (Ed.), Computational linguistics and intelligent text processing: 19th International Conference on CiCLing 2018, Hanoi, Vietnam, March 18-24, 2018Revised selected papers, part 1. Paper presented at 19th International Conference on Computational Linguistics and Intelligent Text Processing, Hanoi, Vietnam, March 18-24, 2018. (pp. 153-167). Springer Science+Business Media B.V.
Open this publication in new window or tab >>Self-adaptive privacy concern detection for user-generated content
2023 (English)In: Computational linguistics and intelligent text processing: 19th International Conference on CiCLing 2018, Hanoi, Vietnam, March 18-24, 2018Revised selected papers, part 1 / [ed] Alexander Gelbukh, Springer Science+Business Media B.V., 2023, p. 153-167Conference paper, Published paper (Refereed)
Abstract [en]

To protect user privacy in data analysis, a state-of-the-art strategy is differential privacy in which scientific noise is injected into the real analysis output. The noise masks individual’s sensitive information contained in the dataset. However, determining the amount of noise is a key challenge, since too much noise will destroy data utility while too little noise will increase privacy risk. Though previous research works have designed some mechanisms to protect data privacy in different scenarios, most of the existing studies assume uniform privacy concerns for all individuals. Consequently, putting an equal amount of noise to all individuals leads to insufficient privacy protection for some users, while over-protecting others. To address this issue, we propose a self-adaptive approach for privacy concern detection based on user personality. Our experimental studies demonstrate the effectiveness to address a suitable personalized privacy protection for cold-start users (i.e., without their privacy-concern information in training data).

Place, publisher, year, edition, pages
Springer Science+Business Media B.V., 2023
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 13396
Keywords
privacy-guaranteed data analysis, deep learning, multi-layer perceptron
National Category
Natural Language Processing
Identifiers
urn:nbn:se:umu:diva-146470 (URN)10.1007/978-3-031-23793-5_14 (DOI)2-s2.0-85149699287 (Scopus ID)978-3-031-23792-8 (ISBN)
Conference
19th International Conference on Computational Linguistics and Intelligent Text Processing, Hanoi, Vietnam, March 18-24, 2018.
Projects
Privacy-aware Data Federation
Note

Preprint published 2018 at arXiv.org.

Available from: 2018-04-10 Created: 2018-04-10 Last updated: 2025-02-07Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-7788-3986

Search in DiVA

Show all publications