Learning Cluster Type and Dissimilarity Metric for Each Cluster Using a Set of Possible Cluster Types
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.
This paper investigates the role of business models for exploiting digital options within digital clusters (that are clusters where collaboration is IT-dependent). To this aim, this research focuses on digital platforms, a specific IT artifact supporting a ...
Using the chromophore of the green fluorescent protein (GFP), the performance of a hybrid RI-CC2/polarizable embedding (PE) model is tested against a quantum chemical cluster approach. Moreover, the effect of the rest of the protein environment is studied ...
The aim of the domain-adaptation task for speaker verification is to exploit unlabelled target domain data by using the labelled source domain data effectively. The i-vector based Probabilistic Linear Dis- criminant Analysis (PLDA) framework approaches thi ...
The aim of the domain-adaptation task for speaker verification is to exploit unlabelled target domain data by using the labelled source domain data effectively. The i-vector based Probabilistic Linear Dis- criminant Analysis (PLDA) framework approaches thi ...
The increasing interest in integrating volatile resources into microgrids implies the necessity of quantifying the uncertainty of photovoltaic (PV) production using dedicated probabilistic forecast techniques. The work presents a novel method to construct ...
Clustering algorithms have evolved to handle more and more complex structures. However, measures allowing to qualify the quality of such partitions are rare and only specic to certain algorithms. In this work, we propose a new cluster validity measure (CVM ...
One challenge in efficient recycling of asphalt concrete is the adherence of the reclaimed asphalt pavement (RAP) particles or clustering that inhibits fulfilling the aggregate gradation requirements. In order to investigate this phenomenon two types of mi ...
Distributed processing over networks relies on in-network processing and cooperation among neighboring agents. Cooperation is beneficial when agents share a common objective. However, in many applications, agents may belong to different clusters that pursu ...
Non-negative matrix factorization (NMF) based sound source separation involves two phases: First, the signal spectrum is decomposed into components which, in a second step, are clustered in order to obtain estimates of the source signal spectra. The major ...
Cooperation among agents across the network leads to better estimation accuracy. However, in many network applications the agents infer and track different models of interest in an environment where agents do not know beforehand which models are being obse ...
