On statistical independence of a contingency matrix

Details On statistical independence of a contingency matrix On statistical independence of a contingency matrix

Mar 2005

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2005spie.5812..291t&link_type=abstract

Data Mining, Intrusion Detection, Information Assurance, and Data Networks Security 2005. Edited by Dasarathy, Belur V. Proc

Other

Scientific paper

A contingency table summarizes the conditional frequencies of two attributes and shows how these two attributes are dependent on each other with the information on a partition of universe generated by these attributes. Thus, this table can be viewed as a relation between two attributes with respect to information granularity. This paper focuses on several characteristics of linear and statistical independence in a contingency table from the viewpoint of granular computing, which shows that statistical independence in a contingency table is a special form of linear dependence. The discussions also show that when a contingency table is viewed as a matrix, called a contingency matrix, its rank is equal to 1.0. Thus, the degree of independence, rank plays a very important role in extracting a probabilistic model from a given contingency table. Furthermore, it is found that in some cases, partial rows or columns will satisfy the condition of statistical independence, which can be viewed as a solving process of Diophatine equations.

Affiliated with

Also associated with

No associations

Rating

On statistical independence of a contingency matrix 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 On statistical independence of a contingency matrix, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On statistical independence of a contingency matrix will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1569410