Making Retrieval Faster Through Document Clustering
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Modeling and predicting student learning in computer-based environments often relies solely on sequences of accuracy data. Previous research suggests that it does not only matter what we learn, but also how we learn. The detection and analysis of learning ...
The problem of clustering in urban traffic networks has been mainly studied in static framework by considering traffic conditions at a given time. Nevertheless, it is important to underline that traffic is a strongly time-variant process and it needs to be ...
Despite the importance of understanding the historical dynamics of ecosystem services (ES), littleresearch has focused on a historical, spatially explicit, assessment of ES supply. This research is aimed at understanding the spatial patterns and potential ...
This paper proposed a multi-keyword ciphertext search, based on an improved-quality hierarchical clustering (MCS-IQHC) method. MCS-IQHC is a novel technique, which is tailored to work with encrypted data. It has improved search accuracy and can self-adapt ...
Background: Obesity and obesity-related diseases represent a major public health concern. Recently, studies have substantiated the role of sugar-sweetened beverages (SSBs) consumption in the development of these diseases.The fine identification of populati ...
We study the problem of constructing epsilon-coresets for the (k, z)-clustering problem in a doubling metric M(X, d). An epsilon-coreset is a weighted subset S subset of X with weight function w : S -> R->= 0, such that for any k-subset C is an element of ...
This article presents two algorithms developed based on two different techniques, from clusterization theory, namely k-means clustering technique and Fuzzy C-means technique, respectively. In this context, the study offers a sustained comparison of the two ...
Collective tunneling is a ubiquitous phenomenon in finite-size spin clusters that shows up in systems as diverse as molecular magnets or spin clusters adsorbed at surfaces. The basic problem we explore is to understand how small flipping terms can cooperat ...
We prove a quantitative estimate on the number of certain singularities in almost minimizing clusters. In particular, we consider the singular points belonging to the lowest stratum of the Federer-Almgren stratification (namely, where each tangent cone doe ...
Data is pervasive in today's world and has actually been for quite some time. With the increasing volume of data to process, there is a need for faster and at least as accurate techniques than what we already have. In particular, the last decade recorded t ...