This report describes the progress made during the Early Career Principal Investigator (ECPI) project on Algorithmic Techniques for Large Data Sets. Research was carried out in the areas of dimension reduction, clustering and finding structure in data, aggregating information from different sources and designing efficient methods for similarity search for high dimensional data. A total of nine different research results were obtained and published in leading conferences and journals
University of Minnesota Ph.D. dissertation.May 2018. Major: Computer Science. Advisor: Yousef Saad....
The recent explosion in size and complexity of datasets and the increased availability of computatio...
The main goal of this research is to produce a novel and efficient searching application by means of...
Doctor of PhilosophyComputational complexity in data mining is attributed to algorithms but lies hug...
University of Technology, Sydney. Faculty of Information Technology.NO FULL TEXT AVAILABLE. Access i...
We review the time and storage costs of search and clustering algorithms. We exemplify these, based ...
Massive high-dimensional data sets are ubiquitous in all scientific disciplines. Extracting meaningf...
Huge data sets containing millions of training examples with a large number of attributes are relati...
The ability to mine and extract useful information from large data sets is a common concern for orga...
In statistics one can distinguish three cases: 1) datasets where the number of dimensions is many ti...
More and more data are produced every day. Some clustering techniques have been developed to automat...
The exploratory nature of data analysis and data mining makes clustering one of the most usual tasks...
Data mining aims at finding interesting, useful or profitable information in very large databases. T...
This dissertation studies two important problems that arise in the analysis of Big Data: high dimens...
Similarity search problems in high-dimensional data arise in many areas of computer science such as ...
University of Minnesota Ph.D. dissertation.May 2018. Major: Computer Science. Advisor: Yousef Saad....
The recent explosion in size and complexity of datasets and the increased availability of computatio...
The main goal of this research is to produce a novel and efficient searching application by means of...
Doctor of PhilosophyComputational complexity in data mining is attributed to algorithms but lies hug...
University of Technology, Sydney. Faculty of Information Technology.NO FULL TEXT AVAILABLE. Access i...
We review the time and storage costs of search and clustering algorithms. We exemplify these, based ...
Massive high-dimensional data sets are ubiquitous in all scientific disciplines. Extracting meaningf...
Huge data sets containing millions of training examples with a large number of attributes are relati...
The ability to mine and extract useful information from large data sets is a common concern for orga...
In statistics one can distinguish three cases: 1) datasets where the number of dimensions is many ti...
More and more data are produced every day. Some clustering techniques have been developed to automat...
The exploratory nature of data analysis and data mining makes clustering one of the most usual tasks...
Data mining aims at finding interesting, useful or profitable information in very large databases. T...
This dissertation studies two important problems that arise in the analysis of Big Data: high dimens...
Similarity search problems in high-dimensional data arise in many areas of computer science such as ...
University of Minnesota Ph.D. dissertation.May 2018. Major: Computer Science. Advisor: Yousef Saad....
The recent explosion in size and complexity of datasets and the increased availability of computatio...
The main goal of this research is to produce a novel and efficient searching application by means of...