Ranking Queries on Probabilistic Linkages
- 477 Downloads
In Chapters 4, 5 and 6, we adopt an independent uncertain object model. That is, we assume that any two uncertain objects in a data set are independent. In many applications, various types of dependencies may exist among real world uncertain objects, such as the case shown in Example 2.12. In this chapter, we study how to answer probabilistic ranking queries on the probabilistic linkage model.
KeywordsMaximal Clique Query Evaluation Probabilistic Linkage Uncertain Object Aggregate Query
Unable to display preview. Download preview PDF.