Demo Data from VLDB 2026 / reviewers in the wild / expert
Inon Axel
dblp:18/5931
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
gene expression analysis |
0.0 | 1 | 2003 | Novel Clustering Algorithm for Microarray Expression Data in A Truncated SVD Space · Bioinform. 2003 |
Bioinformatics and computational biology › gene expression analysis › gene expression clustering
microarray data clustering |
0.0 | 1 | 2003 | Novel Clustering Algorithm for Microarray Expression Data in A Truncated SVD Space · Bioinform. 2003 |
Methods — techniques the papers use, named apart from their topics
singular value decomposition · 0.0quantum clustering · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Novel Clustering Algorithm for Microarray Expression Data in A Truncated SVD SpaceabstractMOTIVATION: This paper introduces the application of a novel clustering method to microarray expression data. Its first stage involves compression of dimensions that can be achieved by applying SVD to the gene-sample matrix in microarray problems. Thus the data (samples or genes) can be represented by vectors in a truncated space of low dimensionality, 4 and 5 in the examples studied here. We find it preferable to project all vectors onto the unit sphere before applying a clustering algorithm. The clustering algorithm used here is the quantum clustering method that has one free scale parameter. Although the method is not hierarchical, it can be modified to allow hierarchy in terms of this scale parameter. RESULTS: We apply our method to three data sets. The results are very promising. On cancer cell data we obtain a dendrogram that reflects correct groupings of cells. In an AML/ALL data set we obtain very good clustering of samples into four classes of the data. Finally, in clustering of genes in yeast cell cycle data we obtain four groups in a problem that is estimated to contain five families. AVAILABILITY: Software is available as Matlab programs at http://neuron.tau.ac.il/~horn/QC.htm. David Horn 0001, Inon Axel |
Bioinform. | 2 |