Explicit probabilistic models for databases and networks

Details Explicit probabilistic models for databases and networks Explicit probabilistic models for databases and networks

2009-06-29

arxiv.org/abs/0906.5148v1

Computer Science

Artificial Intelligence

Submitted

Scientific paper

Recent work in data mining and related areas has highlighted the importance of the statistical assessment of data mining results. Crucial to this endeavour is the choice of a non-trivial null model for the data, to which the found patterns can be contrasted. The most influential null models proposed so far are defined in terms of invariants of the null distribution. Such null models can be used by computation intensive randomization approaches in estimating the statistical significance of data mining results. Here, we introduce a methodology to construct non-trivial probabilistic models based on the maximum entropy (MaxEnt) principle. We show how MaxEnt models allow for the natural incorporation of prior information. Furthermore, they satisfy a number of desirable properties of previously introduced randomization approaches. Lastly, they also have the benefit that they can be represented explicitly. We argue that our approach can be used for a variety of data types. However, for concreteness, we have chosen to demonstrate it in particular for databases and networks.

Affiliated with

Also associated with

No associations

Rating

Explicit probabilistic models for databases and networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Explicit probabilistic models for databases and networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Explicit probabilistic models for databases and networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-246992