default search action
Mihael Ankerst
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [r2]Mihael Ankerst:
Visual Classification. Encyclopedia of Database Systems (2nd ed.) 2018
2000 – 2009
- 2009
- [r1]Mihael Ankerst:
Visual Classification. Encyclopedia of Database Systems 2009: 3352-3355 - 2008
- [p2]Mihael Ankerst, Anne Kao, Rodney Tjoelker, Changzhou Wang:
DataJewel: Integrating Visualization with Temporal Data Mining. Visual Data Mining 2008: 312-330 - 2005
- [p1]Daniel A. Keim, Mike Sips, Mihael Ankerst:
Visual Data-Mining Techniques An earlier version of this paper with focus on visualization techniques and their classification has been published in Visual Data Analysis: An Introduction (D. Hand and M. Berthold, Eds.). The Visualization Handbook 2005: 831-843 - 2004
- [j4]Mihael Ankerst:
Kooperatives Data Mining: Eine Integration von Data-Mining-Algorithmen und Visualisierungstechniken. Datenbank-Spektrum 9: 6-10 (2004) - 2002
- [j3]Mihael Ankerst:
Report on the SIGKDD-2002 Panel The Perfect Data Mining Tool: Interactive or Automated. SIGKDD Explor. 4(2): 110-111 (2002) - 2001
- [b1]Mihael Ankerst:
Visual data mining. Ludwig Maximilian University of Munich, Germany, dissertation.de 2001, ISBN 978-3-89825-201-0, pp. 1-216 - 2000
- [c8]Mihael Ankerst, Martin Ester, Hans-Peter Kriegel:
Towards an effective cooperation of the user and the computer for classification. KDD 2000: 179-188
1990 – 1999
- 1999
- [j2]Mihael Ankerst, Christian Elsen, Martin Ester, Hans-Peter Kriegel:
Perception-Based Classification. Informatica (Slovenia) 23(4) (1999) - [c7]Mihael Ankerst, Gabi Kastenmüller, Hans-Peter Kriegel, Thomas Seidl:
Nearest Neighbor Classification in 3D Protein Databases. ISMB 1999: 34-43 - [c6]Mihael Ankerst, Christian Elsen, Martin Ester, Hans-Peter Kriegel:
Visual Classification: An Interactive Approach to Decision Tree Construction. KDD 1999: 392-396 - [c5]Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel, Jörg Sander:
OPTICS: Ordering Points To Identify the Clustering Structure. SIGMOD Conference 1999: 49-60 - [c4]Mihael Ankerst, Gabi Kastenmüller, Hans-Peter Kriegel, Thomas Seidl:
3D Shape Histograms for Similarity Search and Classification in Spatial Databases. SSD 1999: 207-226 - 1998
- [j1]Mihael Ankerst, Hans-Peter Kriegel, Thomas Seidl:
A Multistep Approach for Shape Similarity Search in Image Databases. IEEE Trans. Knowl. Data Eng. 10(6): 996-1004 (1998) - [c3]Mihael Ankerst, Stefan Berchtold, Daniel A. Keim:
Similarity Clustering of Dimensions for an Enhanced Visualization of Multidimensional Data. INFOVIS 1998: 52-60 - [c2]Mihael Ankerst, Bernhard Braunmüller, Hans-Peter Kriegel, Thomas Seidl:
Improving Adaptable Similarity Query Processing by Using Approximations. VLDB 1998: 206-217 - 1995
- [c1]Daniel A. Keim, Mihael Ankerst, Hans-Peter Kriegel:
Recursive Pattern: A Technique for Visualizing Very Large Amounts of Data. IEEE Visualization 1995: 279-286
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint