EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Multi-level high utility-itemset hiding

Loan T T Nguyen, Hoa Duong iD, An Mai iD, Bay Vo iD

PLOS ONE · 2025

DOI: 10.1371/journal.pone.0317427 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PLOS ONE, 2025. Verfasst von Loan T T Nguyen und 3 weiteren Autor:innen. Beteiligte Einrichtung: School of Computer Science and Engineering, International University, Ho Chi Minh City, Vietnam. Hauptthemen laut MEDLINE: Data Mining, Privacy, Computer Security. Die Arbeit nennt 54 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Vietnam National University HoChiMinh City.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Privacy is as a critical issue in the age of data. Organizations and corporations who publicly share their data always have a major concern that their sensitive information may be leaked or extracted by rivals or attackers using data miners. High-utility itemset mining (HUIM) is an extension to frequent itemset mining (FIM) which deals with business data in the form of transaction databases, data that is also in danger of being stolen. To deal with this, a number of privacy-preserving data mining (PPDM) techniques have been introduced. An important topic in PPDM in the recent years is privacy-preserving utility mining (PPUM). The goal of PPUM is to protect the sensitive information, such as sensitive high-utility itemsets, in transaction databases, and make them undiscoverable for data mining techniques. However, available PPUM methods do not consider the generalization of items in databases (categories, classes, groups, etc.). These algorithms only consider the items at a specialized level, leaving the item combinations at a higher level vulnerable to attacks. The insights gained from higher abstraction levels are somewhat more valuable than those from lower levels since they contain the outlines of the data. To address this issue, this work suggests two PPUM algorithms, namely MLHProtector and FMLHProtector , to operate at all abstraction levels in a transaction database to protect them from data mining algorithms. Empirical experiments showed that both algorithms successfully protect the itemsets from being compromised by attackers.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Data MiningPrivacyComputer SecurityAlgorithmsHumansDatabases, Factual

Autor:innen und Institutionen

  • School of Computer Science and Engineering, International University, Ho Chi Minh City, Vietnam.
  • Vietnam National University, Ho Chi Minh City, Vietnam.
  • Faculty of Information Technology, HUTECH University, Ho Chi Minh City, Vietnam.

ORCID-Profile: Hoa Duong, An Mai, Bay Vo

Förderung

  • Vietnam National University HoChiMinh City

Zitieren

APA

Nguyen, L. T. T., Duong, H., Mai, A., & Vo, B. (2025). Multi-level high utility-itemset hiding. PLOS ONE. https://doi.org/10.1371/journal.pone.0317427

Vancouver

Nguyen LTT, Duong H, Mai A, Vo B. Multi-level high utility-itemset hiding. PLOS ONE. 2025. doi:10.1371/journal.pone.0317427

BibTeX
@article{Nguyen2025,
  author = {Nguyen, Loan T T and Duong, Hoa and Mai, An and Vo, Bay},
  title = {Multi-level high utility-itemset hiding},
  journal = {PLOS ONE},
  year = {2025},
  doi = {10.1371/journal.pone.0317427}
}
Kostenlos starten →