Enhancing clustering quality through landmark-based dimensionality reduction

P Magdalinos, C Doulkeridis… - ACM Transactions on …, 2011 - dl.acm.org
Scaling up data mining algorithms for data of both high dimensionality and cardinality has
been lately recognized as one of the most challenging problems in data mining research …

Federated One-Shot Ensemble Clustering

R Duan, X Xiong, J Liu, KP Liao, T Cai - arXiv preprint arXiv:2409.08396, 2024 - arxiv.org
Cluster analysis across multiple institutions poses significant challenges due to data-sharing
restrictions. To overcome these limitations, we introduce the Federated One-shot Ensemble …

Fedra: A fast and efficient dimensionality reduction algorithm

P Magdalinos, C Doulkeridis, M Vazirgiannis - Proceedings of the 2009 SIAM …, 2009 - SIAM
Contemporary data-intensive applications generate large datasets of very high
dimensionality. Data management in high-dimensional spaces presents problems, such as …

Distributed knowledge discovery with non linear dimensionality reduction

P Magdalinos, M Vazirgiannis, D Valsamou - Advances in Knowledge …, 2010 - Springer
Data mining tasks results are usually improved by reducing the dimensionality of data. This
improvement however is achieved harder in the case that data lay on a non linear manifold …

Machine Learning and Neural Networks

MQF LEVEL - 2022 - stmartins.edu
This study unit is about machine learning and neural networks provide means for computer
systems to extract useful information out of data. These techniques are widely used in the …

Linear and non linear dimensionality reduction for distributed knowledge discovery

P Magdalinos - 2010 - didaktorika.gr
An increasing number of contemporary applications produce massive volumes of very high
dimensional data. In scientific databases, for example, it is common to encounter large sets …

Transitive identity mapping using force-based clustering

H Van Dyke Parunak, S Brueckner - … , ADMI 2013, Saint Paul, MN, USA …, 2014 - Springer
In most information retrieval systems, software processes (whether agent-based or not)
reason about passive items of data. An alternative approach instantiates each record as an …

X-SDR: an extensible experimentation suite for dimensionality reduction

P Magdalinos, A Kapernekas, A Mpiratsis… - Machine Learning and …, 2010 - Springer
Due to the vast amount and pace of high-dimensional data production, dimensionality
reduction emerges as an important requirement in many application areas. In this paper, we …

[PDF][PDF] Force-based clustering for transitive identity mapping.

HVD Parunak, SA Brueckner - AAMAS, 2013 - abcresearch.org
In most information retrieval systems, software processes (whether agent-based or not)
reason about passive items of data. An alternative approach instantiates each piece of …

Organizing and searching data in unstructured P2P networks

C Doulkeridis - 2007 - didaktorika.gr
As data generation becomes increasingly inherently distributed, either due to user-
generated (multimedia) content or because of application-specific needs (sensor networks …