Real-time data selection and ordering for cognitive bias mitigation

Sara Mourad, Ahmed Tewfik
2016 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
Proposed approximate solution: an extension of the approximate subset sum algorithm  The extension of the approximate subset sum algorithm is used to find the closest ′ to the target T  S={ 1 , 2 ,..., }. S1={S,S,...,S} N' times-> To account for permutations of same subset  G tracks sizes of each element in R  Trimming function modified to keep only smallest size subset  Returned subset sum has restricted size ≤ ′ Performance guarantee -Running time • Proposed algorithm returns * : •
more » ... returns * : • Running time of algorithm: ( ′ log ′) and O (1/ )
doi:10.1109/icassp.2016.7472507 dblp:conf/icassp/MouradT16 fatcat:xpwgiswcxvedfksragsjls6qyi