scispace - formally typeset
Proceedings ArticleDOI

Apply incremental classification for a P2P MOD system

TLDR
A digital content platform, which combines peer-to-peer (P2P) technology and sharable content object reference model (SCORM) makes it possible for content providers to share versatile multimedia information with others in digital channel.
Abstract
With the fast development of technology and science, there come various changes and demands in consumer service market. The plan integrating "broadband network" with "application service" is potential and farsighted in network industry. Academic and technological institutes start researching and promoting the MOD (multimedia on demand) system, which transits multimedia information and provides users interactive interface via setop-box in broadband network. Implement cost, learning content and user behaviors might be taken into account when constructing MOD system. Besides, how to increase the MOD's capability of interaction and portability is a practical issue. Sharing and participating are of great importance for network users. This paper first proposes a digital content platform, which combines peer-to-peer (P2P) technology and sharable content object reference model (SCORM). Such a mechanism makes it possible for content providers to share versatile multimedia information with others in digital channel. Followed by a description of file sharing methods in P2P framework. Then, we advocate incremental k-nearest-neighbor (k-NN) algorithm analyzing SCORM metadata and user access records to improve system load, content feature classification efficiency, file index distribution and user query-feedback speed.

read more

References
More filters
Proceedings ArticleDOI

Making gnutella-like P2P systems scalable

TL;DR: This work proposes several modifications to Gnutella's design that dynamically adapt the overlay topology and the search algorithms in order to accommodate the natural heterogeneity present in most peer-to-peer systems.
Journal ArticleDOI

Distance browsing in spatial databases

TL;DR: The incremental nearest neighbor algorithm significantly outperforms the existing k-nearest neighbor algorithm for distance browsing queries in a spatial database that uses the R-tree as a spatial index and it is proved informally that at any step in its execution the incremental nearest neighbors algorithm is optimal with respect to the spatial data structure that is employed.
Journal Article

Semantic overlay clusters within super-peer networks

TL;DR: In this article, the concept of semantic overlay clusters (SOC) is introduced for super-peer networks enabling a controlled distribution of peers to clusters, based on predefined policies defined by human experts.
Posted Content

An Improved k-Nearest Neighbor Algorithm for Text Categorization

TL;DR: An improved kNN algorithm is proposed, which uses different numbers of nearest neighbors for different categories, rather than a fixed number across all categories, and is promising for some cases, where estimating the parameter k via cross-validation is not allowed.
Book ChapterDOI

Semantic Overlay Clusters within Super-Peer Networks

TL;DR: This work introduces the concept of semantic overlay clusters (SOC) for super-peer networks enabling a controlled distribution of peers to clusters and allows a clustering of complex heterogeneous schemes known from relational databases and use advantages of super- peer networks, such as efficient search and broadcast of messages.
Related Papers (5)