Computing rarity on uncertain data

DOI10.1007/S11432-011-4378-5zbMATH Open1267.68183OpenAlexW1991142354MaRDI QIDQ350968FDOQ350968

Authors: Cheqing Jin, Minqi Zhou, Aoying Zhou 

Publication date: 3 July 2013

Published in: Science China Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-011-4378-5

Recommendations

• Uncertain Frequent Pattern Mining
• Probabilistic top-\(k\) and ranking query algorithms in uncertain databases
• Mining maximal frequent itemsets in uncertain data
• Continuous ranking on uncertain streams
• Interactive Mining of Probabilistic Frequent Patterns in Uncertain Databases

zbMATH Keywords

uncertain datararitypossible world

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Size-estimation framework with applications to transitive closure and reachability
• Title not available (Why is that?)
• Efficient aggregation algorithms for probabilistic data
• Managing and mining uncertain data

Cited In (4)

• Granular counting of uncertain data
• Continuous ranking on uncertain streams
• Possibilistic Bounds for Granular Counting
• World-set decompositions: Expressiveness and efficient algorithms

Uses Software

• Trio

This page was built for publication: Computing rarity on uncertain data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q350968)