Author image not provided
 Alexander Hinneburg

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article21.57
Citation Count604
Publication count28
Publication years1998-2015
Available for download8
Average downloads per article665.63
Downloads (cumulative)5,325
Downloads (12 Months)254
Downloads (6 Weeks)46
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


26 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 26
Result page: 1 2

Sort by:

1 published by ACM
February 2015 WSDM '15: Proceedings of the Eighth ACM International Conference on Web Search and Data Mining
Publisher: ACM
Bibliometrics:
Citation Count: 36
Downloads (6 Weeks): 42,   Downloads (12 Months): 204,   Downloads (Overall): 651

Full text available: PDFPDF
Quantifying the coherence of a set of statements is a long standing problem with many potential applications that has attracted researchers from different sciences. The special case of measuring coherence of topics has been recently studied to remedy the problem that topic models give no guaranty on the interpretablity of ...
Keywords: topic coherence, topic evaluation, topic model

2 published by ACM
November 2014 CIKM '14: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 14,   Downloads (Overall): 151

Full text available: PDFPDF
Topics automatically derived by topic models are not always easy and clearly interpretable by humans. The most probable top words of a topic may leave room for ambiguous interpretations, especially when the top words are exclusively nouns. We demonstrate how part-of-speech (POS) tagging and co-location analysis of terms can be ...
Keywords: topic frame, topic model, visualization

3
August 2014 DATA 2014: Proceedings of 3rd International Conference on Data Management Technologies and Applications
Publisher: SCITEPRESS - Science and Technology Publications, Lda
Bibliometrics:
Citation Count: 0

We outline a blueprint for the development of new computer science approaches for the management and analysis of big data problems for biodiversity science. Such problems are characterized by a combination of different data sources each of which owns at least one of the typical characteristics of big data (volume, ...
Keywords: Data Analysis, Research Strategy, Biodiversity Informatics

4
September 2012 ECMLPKDD'12: Proceedings of the 2012th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

The demo presents a prototype - called TopicExplorer - that combines topic modeling, key word search and visualization techniques to explore a large collection of Wikipedia documents. Topics derived by Latent Dirichlet Allocation are presented by top words. In addition, topics are accompanied by image thumbnails extracted from related Wikipedia ...
Keywords: document browser, topic model

5 published by ACM
May 2012 SIGMOD '12: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Publisher: ACM
Bibliometrics:
Citation Count: 0

Finding correlated words in large document collections is an important ingredient for text analytics. The naïve approach computes the correlations of each word against all other words and filters for highly correlated word pairs. Clearly, this quadratic method cannot be applied to real world scenarios with millions of documents and ...
Keywords: locality sensitive hashing, pearson correlation, word correlations, text mining

6 published by ACM
May 2011 WIMS '11: Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 2,   Downloads (Overall): 118

Full text available: PDFPDF
We study in a quantitative way whether the most popular tags in a collaborative tagging system are distinctive features when looking at the underlying content. For any set of annotations being helpful in searching, this property must necessarily hold to a strong degree. Our initial experiments show that the most ...
Keywords: tagging, text mining, collaborative information systems

7
October 2007 ICDM '07: Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4

Probabilistic latent semantic indexing (PLSI) represents documents of a collection as mixture proportions of latent topics, which are learned from the collection by an expectation maximization (EM) algorithm. New documents or queries need to be folded into the latent topic space by a simplified version of the EM-algorithm. During PLSIFolding-in ...

8
September 2007 IDA'07: Proceedings of the 7th international conference on Intelligent data analysis
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 41

The Denclue algorithm employs a cluster model based on kernel density estimation. A cluster is defined by a local maximum of the estimated density function. Data points are assigned to clusters by hill climbing, i.e. points going to the same local maximum are put into the same cluster. A disadvantage ...

9
June 2007 DILS'07: Proceedings of the 4th international conference on Data integration in the life sciences
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

2D-Nuclear magnetic resonance (NMR) spectroscopy is a powerful analytical method to elucidate the chemical structure of molecules. In contrast to 1D-NMR spectra, 2D-NMR spectra correlate the chemical shifts of 1 H and 13 C simultaneously. To curate or merge large spectra libraries a robust (and fast) duplicate detection is needed. ...

10
March 2007 BIRD'07: Proceedings of the 1st international conference on Bioinformatics research and development
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Searching and mining nuclear magnetic resonance (NMR)- spectra of naturally occurring substances is an important task to investigate new potentially useful chemical compounds. Multi-dimensional NMR-spectra are relational objects like documents, but consists of continuous multi-dimensional points called peaks instead of words. We develop several mappings from continuous NMR-spectra to discrete ...

11
September 2006 ECMLPKDD'06: Proceedings of the 10th European Conference on Principles and Practice of Knowledge Discovery in Databases
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

Searching and mining nuclear magnetic resonance (NMR)-spectra of naturally occurring products is an important task to investigate new potentially useful chemical compounds. We develop a set-based similarity function, which, however, does not sufficiently capture more abstract aspects of similarity. NMR-spectra are like documents, but consists of continuous multi-dimensional points instead ...

12 published by ACM
August 2005 KDD '05: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Publisher: ACM
Bibliometrics:
Citation Count: 13
Downloads (6 Weeks): 1,   Downloads (12 Months): 13,   Downloads (Overall): 976

Full text available: PDFPDF
It is commonly assumed that high-dimensional datasets contain points most of which are located in low-dimensional manifolds. Detection of low-dimensional clusters is an extremely useful task for performing operations such as clustering and classification, however, it is a challenging computational problem. In this paper we study the problem of finding ...
Keywords: clustering, fractal dimension

13
June 2005 SSDBM'2005: Proceedings of the 17th international conference on Scientific and statistical database management
Publisher: Lawrence Berkeley Laboratory
Bibliometrics:
Citation Count: 4


14
June 2004 Multimedia Systems: Volume 10 Issue 1, June 2004
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Typically searching image collections is based on features of the images. In most cases the features are based on the color histogram of the images. Similarity search based on color histograms is very efficient, but the quality of the search results is often rather poor. One of the reasons is ...

15
September 2003 VLDB '03: Proceedings of the 29th international conference on Very large data bases - Volume 29
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 136

Full text available: PDFPDF
Database support for data mining has become an important research topic. Especially for large high-dimensional data volumes, comprehensive support from the database side is necessary. In this paper we identify the data intensive subproblem of aggregating high-dimensional data in all possible low-dimensional projections (for instance estimating low-dimensional histograms), which occurs ...

16
July 2003 SSDBM '03: Proceedings of the 15th International Conference on Scientific and Statistical Database Management
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 2

The progress in genome research demands for an adequate infrastructure to analyse the data sets. Database systems reflect a key technology to organize data and speed up the analysis process. This paper discusses the role of a relational database system based on the problem of finding frequent substructures in multi-dimensional ...

17
March 2003 Computing in Science and Engineering: Volume 5 Issue 2, March 2003
Publisher: IEEE Educational Activities Department
Bibliometrics:
Citation Count: 2

The clustering of large databases is an important research area with a large variety of applications in the database context. Missing in most of the research efforts are means for guiding the clustering process and understanding the results, which is especially important for high-dimensional data. Visualization technology may help solve ...
Keywords: high-dimensional data, projections, clusters, databases, search algorithms

18 published by ACM
June 2002 SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 6,   Downloads (Overall): 368

Full text available: PDFPDF
Clustering of large data bases is an important research area with a large variety of applications in the data base context. Missing in most of the research efforts are means for guiding the clustering process and understanding the results, which is especially important for high dimensional data. Visualization technology may ...

19
January 2001 ICDT '01: Proceedings of the 8th International Conference on Database Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 191

In recent years, the effect of the curse of high dimensionality has been studied in great detail on several problems such as clustering, nearest neighbor search, and indexing. In high dimensional space the data becomes sparse, and traditional indexing and algorithmic techniques fail from a efficiency and/or effectiveness perspective. Recent ...

20
November 2000 BIBE '00: Proceedings of the 1st IEEE International Symposium on Bioinformatics and Biomedical Engineering
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

In the past, a good number of rotamer libraries have been published, which allow a deeper understanding of the conformational behavior of amino acid residues in proteins. Since the number of available high-resolution X-ray protein structures has grown significantly over the last years, a more comprehensive analysis of the conformational ...
Keywords: biology computing, conformational behavior, physics computing, proteins, secondary structure elements, sequences, small amino acid chains, amino acid residues, asparagine residues, molecular biophysics, molecular configurations, rotamer libraries, dependence detection, protein folding, 3D structure clustering algorithm, X-ray diffraction, high-resolution X-ray protein structures, sequential context, threonine, tripeptide fragments



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us