|
||||||||||||||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||||||||||||
ABSTRACT
Profile carrying agents offer the opportunity of meeting like minds and increasing efficiency in many information search applications. Profiles can also increase the sophistication of relationships and interactions in multi-agent systems in general. Such profiles or feature lists may be of the agent owner or of the information sought. Two key issues are choice of similarity measure and privacy of profiles. In this paper we adapt techniques used in information visualization and classification to address these two problems. The basic idea is to map the high dimensional profiles into a low dimensional space. The mapping is one-way, so that privacy is achieved. To compare mapped profiles in the low dimensional space, we discuss the choice of a number of similarity measures. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
INDEX TERMS
Primary Classification:
Additional Classification:
General Terms:
|
||||||||||||||||||||||||||||||||||||||||||||||