Surcharge informationnelle

Résumé

La surcharge informationnelle (en anglais information overload), surinformation ou infobésité (néologisme québécois), est l'excès d'informations, qu'une personne ne peut traiter ou supporter sans nuire à elle-même ou à son activité. Cette notion est également évoquée par le sociologue Edgar Morin sous l'appellation de « nuage informationnel ». Histoire Bien que ce concept soit au début du étroitement lié au développement des chaînes de télévision d'information en continu, à l'utilisation des technologies de l'information et de la communication et, en particulier, des nouvelles technologies de l'information représentées par Internet, il a fait son apparition dès le début des années 1960 comme l'une des sources de dysfonctionnement des organisations. Les principaux auteurs sur le sujet sont Caroline Sauvajol-Rialland en France, David Shenk aux États-Unis (Data Smog, Surviving the Information Glut), Jim Stolze (L’infobésité pourrait être la prochaine épidémie) et Nicholas C

Source officielle

https://fr.wikipedia.org/wiki/Surcharge_informationnelle

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (12)

Publications associées

Chargement

Personnes associées (1)

Personnes associées

Chargement

Unités associées (1)

Unités associées

Chargement

Concepts associés (11)

vignette|redresse=1.5| Anneaux concentriques sur un arbre afin de représenter quelques dates importantes de la révolution numérique de 1968 à 2017. L'ère de l'information (aussi connue comme ère numér

A search engine is a software system that finds web pages that match a web search. They search the World Wide Web in a systematic way for particular information specified in a textual web search que

vignette|redresse=0.6|Pictogramme représentant une information. L’information est un de la discipline des sciences de l'information et de la communication (SIC). Au sens étymologique, l'« informatio

Afficher plus

Concepts associés

Chargement

Cours associés (6)

This course introduces the key concepts and algorithms from the areas of information retrieval, data mining and knowledge bases, which constitute the foundations of today's Web-based distributed information systems.

Dans ce cours, nous présentons les méthodes de base du traitement des signaux.

This course gives an introduction to the fundamental concepts and methods of the Digital Humanities, both from a theoretical and applied point of view. The course introduces the Digital Humanities circle of processing and interpretation, from data acquisition to new understandings.

Afficher plus

Cours associés

Chargement

Séances de cours associées (7)

Séances de cours associées

Chargement

Top-k/w publish/subscribe: A publish/subscribe model for continuous top-k processing over data streams

Karl Aberer, Kresimir Pripuzic

Continuous processing of top-k queries over data streams is a promising technique for alleviating the information overload problem as it distinguishes relevant from irrelevant data stream objects with respect to a given scoring function over time. Thus it enables filtering of irrelevant data objects and delivery of top-k objects relevant to user interests in real-time. We propose a solution for distributed continuous top-k processing based on the publish/subscribe communication paradigm-top-k publish/subscribe over sliding windows (top-k/w publish/subscribe). It identifies k best-ranked objects with respect to a given scoring function over a sliding window of size w, and extends the publish/subscribe communication paradigm by continuous top-k processing algorithms coming from the field of data stream processing. In this paper, we introduce, analyze and evaluate the essential building blocks of distributed top-k/w publish/subscribe systems: first, we present a formal top-k/w publish/subscribe model and compare it to the prevailing Boolean publish/subscribe model. Next, we outline the top-k/w processing tasks performed by publish/subscribe nodes and investigate the properties of supported scoring functions. Furthermore, we explore potential routing strategies for distributed top-k/w publish/subscribe systems. Finally, we experimentally evaluate model properties and provide a comparative study investigating traffic requirements of potential routing strategies. (C) 2013 Elsevier Ltd. All rights reserved.

Pergamon-Elsevier Science Ltd2014

Chargement

, ,

A sliding-window k-NN query (k-NN/w query) continuously monitors incoming data stream objects within a sliding window to identify k closest objects to a query. It enables effective filtering of data objects streaming in at high rates from potentially distributed sources, and offers means to control the rate of object insertions into result streams. Therefore k-NN/w processing systems may be regarded as one of the prospective solutions for the information overload problem in applications that require processing of structured data in real-time, such as the Sensor Web. Existing k-NN/w processing systems are mainly centralized and cannot cope with multiple data streams, where data sources are scattered over the Internet. In this paper, we propose a solution for distributed continuous k-NN/w processing of structured data from distributed streams. We define a k-NN/w processing model for such setting, and design a distributed k-NN/w processing system on top of the Content-Addressable Network (CAN) overlay. An extensive evaluation using both real and synthetic data sets demonstrates the feasibility of the proposed solution because it balances the load among the peers, while the messaging overhead within the P2P network remains reasonable. Moreover, our results clearly show the solution is scalable for an increasing number of queries and peers.

Springer Verlag2011

Chargement

Top-k/w publish/subscribe: A publish/subscribe model for continuous top-k processing over data streams

Karl Aberer, Ivana Podnar, Kresimir Pripuzic

Continuous processing of top-k queries over data streams is a promising technique for alleviating the information overload problem as it distinguishes relevant from irrelevant data stream objects with respect to a given scoring function over time. Thus it enables filtering of irrelevant data objects and delivery of top-k objects relevant to user interests in real-time. We propose a solution for distributed continuous top-k processing based on the publish/subscribe communication paradigm—top-k publish/subscribe over sliding windows (top-k/w publish/subscribe). It identifies k best-ranked objects with respect to a given scoring function over a sliding window of size w, and extends the publish/subscribe communication paradigm by continuous top-k processing algorithms coming from the field of data stream processing. In this paper, we introduce, analyze and evaluate the essential building blocks of distributed top-k/w publish/subscribe systems: first, we present a formal top-k/w publish/subscribe model and compare it to the prevailing Boolean publish/subscribe model. Next, we outline the top-k/w processing tasks performed by publish/subscribe nodes and investigate the properties of supported scoring functions. Furthermore, we explore potential routing strategies for distributed top-k/w publish/subscribe systems. Finally, we experimentally evaluate model properties and provide a comparative study investigating traffic requirements of potential routing strategies.

Wiley-Blackwell2014

Chargement