Creating Prototypes for Fast Classification in Dempster-Shafer Clustering

Details Creating Prototypes for Fast Classification in Dempster-Shafer Clustering Creating Prototypes for Fast Classification in Dempster-Shafer Clustering

2003-05-16

arxiv.org/abs/cs/0305021v1

in Qualitative and Quantitative Practical Reasoning, Proceedings of the First International Joint Conference on Qualitative an

Computer Science

Artificial Intelligence

11 pages, 3 figures

Scientific paper

We develop a classification method for incoming pieces of evidence in Dempster-Shafer theory. This methodology is based on previous work with clustering and specification of originally nonspecific evidence. This methodology is here put in order for fast classification of future incoming pieces of evidence by comparing them with prototypes representing the clusters, instead of making a full clustering of all evidence. This method has a computational complexity of O(M * N) for each new piece of evidence, where M is the maximum number of subsets and N is the number of prototypes chosen for each subset. That is, a computational complexity independent of the total number of previously arrived pieces of evidence. The parameters M and N are typically fixed and domain dependent in any application.

Affiliated with

Also associated with

No associations

Rating

Creating Prototypes for Fast Classification in Dempster-Shafer Clustering 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 Creating Prototypes for Fast Classification in Dempster-Shafer Clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Creating Prototypes for Fast Classification in Dempster-Shafer Clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-545275