Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
Modeling and analyzing networks is a major emerging topic in different research areas, such as computational biology, social science, document retrieval and social web applications.By connecting objects, it is possible to obtain an intuitive and global view of the relationships among components of a complex system.Nowadays, scientific communities have access to huge volume of network-structured data, such as social networks, gene/proteins/metabolic networks, sensor networks, and peer-to-peer networks.Often, data is collected at different time points allowing capturing a dynamic trend of the observed network.Consequently, the time component plays a key role in the comprehension of the evolutionary behavior of the studied network (evolution of the network structure and/or of flows within the system).Time can help to determine the real causal relationships within, for instance, gene activations, link creation, and information flow.Handling such data is a major challenge for current research in machine learning and data mining, and it has led to the development of recent innovative techniques that consider complex/multi-level networks, time-evolving graphs, heterogeneous information (nodes and links), and requires scalable algorithms that are able to manage large-scale complex networks.This special issue is the follow-up of the Dynamic Networks and Knowledge Discovery workshop (DyNaK) 1 that has been held in conjunction to ECML-PKDD 2011 at Barcelona on September 24th 2011.The workshop was motivated by the interest of providing a meeting point for scientists with different backgrounds who are interested in the study of large-scale dynamic complex networks.The workshop has attracted 18 submissions out of which 9 papers has been accepted.The workshop has gathered more than 30 participants and was also the host of three highly appreciated invited keynotes and one industrial talk.Building on the success of the DyNaK workshop, an open call for papers has been issued for this special issue, focusing on the major topic discussed in the workshop: analyzing, modeling and mining large-scale real network.15 high quality papers have been received; each of which has been reviewed by three reviewers.Only 7 contributions were finally selected.These contributions show the vitality of the field: a broad panel of techniques are applied to modeling the dynamics of complex systems, using a wide set of formalisms ranging from descriptive rules to Probabilistic Real-Time Automata.Application fields are also wide: vision, opinion diffusion in social network, business process modeling and text mining.In Internal link prediction: a new approach for predicting links in bipartite graphs, Allali et al. present an algorithm for predicting internal link in bipartite graph.They address the problem of predicting
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,002 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,002 | 0,002 |
| Méta-épidémiologie (sens large) | 0,004 | 0,002 |
| Bibliométrie | 0,002 | 0,005 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,002 | 0,001 |
| Science ouverte | 0,009 | 0,005 |
| Intégrité de la recherche | 0,001 | 0,002 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,007 | 0,006 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle