Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficiently mining uncertain high-utility itemsets

From MaRDI portal
Publication:1701787
Jump to:navigation, search

DOI10.1007/S00500-016-2159-1zbMath1381.68246OpenAlexW2347204429MaRDI QIDQ1701787

Philippe Fournier-Viger, Vincent S. Tseng, Tzung-Pei Hong, Wensheng Gan, Jerry Chun- Wei Lin

Publication date: 27 February 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-016-2159-1


zbMATH Keywords

uncertaintydata mininghigh-utility itemsetlarge-scale datasetpruning strategies


Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)


Related Items (4)

An efficient approach for mining weighted uncertain interesting patterns ⋮ Efficiently mining uncertain high-utility itemsets ⋮ Correlated utility-based pattern mining ⋮ Efficient approach of recent high utility stream pattern mining with indexed list structure and pruning strategy considering arrival times of transactions




Cites Work

  • Mining top-\(k\) high utility patterns over data streams
  • Managing and mining uncertain data
  • Efficiently mining uncertain high-utility itemsets




This page was built for publication: Efficiently mining uncertain high-utility itemsets

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1701787&oldid=14022100"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 06:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki