default search action
Arturas Mazeika
Person information
- affiliation: Free University of Bozen-Bolzano, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [j4]Dimitar Denev, Arturas Mazeika, Marc Spaniol, Gerhard Weikum:
The SHARC framework for data quality in Web archiving. VLDB J. 20(2): 183-207 (2011) - [c10]Dietrich Christopeit, Michael H. Böhlen
, Carl-Christian Kanne, Arturas Mazeika:
Querying Versioned Software Repositories. ADBIS 2011: 42-55 - [c9]Arturas Mazeika, Tomasz Tylenda, Gerhard Weikum:
Entity timelines: visual analytics and named entity evolution. CIKM 2011: 2585-2588
2000 – 2009
- 2009
- [j3]Dimitar Denev, Arturas Mazeika, Marc Spaniol
SHARC: Framework for Quality-Conscious Web Archiving. Proc. VLDB Endow. 2(1): 586-597 (2009) - [c8]Michail Kazimianec, Arturas Mazeika:
Clustering of Short Strings in Large Databases. DEXA Workshops 2009: 368-372 - [c7]Andrej Taliun, Michael H. Böhlen, Arturas Mazeika:
CORE: Nonparametric Clustering of Large Numeric Databases. SDM 2009: 14-25 - [c6]Marc Spaniol
Data quality in web archiving. WICOW 2009: 19-26 - 2008
- [c5]Arturas Mazeika, Michael H. Böhlen
Analysis and Interpretation of Visual Hierarchical Heavy Hitters of Binary Relations. ADBIS 2008: 168-183 - [p5]Simeon J. Simoff, Michael H. Böhlen
Visual Data Mining: An Introduction and Overview. Visual Data Mining 2008: 1-12 - [p4]Michael H. Böhlen
The 3DVDM Approach: A Case Study with Clickstream Data. Visual Data Mining 2008: 13-29 - [p3]Arturas Mazeika, Michael H. Böhlen
Using Nested Surfaces for Visual Detection of Structures in Databases. Visual Data Mining 2008: 91-102 - [p2]Daniel Trivellato, Arturas Mazeika, Michael H. Böhlen
Using 2D Hierarchical Heavy Hitters to Investigate Binary Relationships. Visual Data Mining 2008: 215-235 - [p1]Simeon J. Simoff, Michael H. Böhlen
Assisting Human Cognition in Visual Data Mining. Visual Data Mining 2008: 264-280 - [e1]Simeon J. Simoff, Michael H. Böhlen, Arturas Mazeika:
Visual Data Mining - Theory, Techniques and Tools for Visual Analytics. Lecture Notes in Computer Science 4404, Springer 2008, ISBN 978-3-540-71079-0 [contents] - 2007
- [j2]Arturas Mazeika, Michael H. Böhlen
Estimating the selectivity of approximate string queries. ACM Trans. Database Syst. 32(2): 12 (2007) - 2006
- [c4]Arturas Mazeika, Janis Petersons, Michael H. Böhlen:
PPPA: Push and Pull Pedigree Analyzer for Large and Complex Pedigree Databases. ADBIS 2006: 339-352 - [c3]Arturas Mazeika, Michael H. Böhlen:
Cleansing Databases of Misspelled Proper Nouns. CleanDB 2006 - [c2]Linas Baltrunas, Arturas Mazeika, Michael H. Böhlen
Multi-dimensional Histograms with Tight Bounds for the Error. IDEAS 2006: 105-112 - [c1]Arturas Mazeika, Michael H. Böhlen, Andrej Taliun:
Adaptive Density Estimation. VLDB 2006: 1191-1194 - 2003
- [j1]Michael H. Böhlen
3D visual data mining - goals and experiences. Comput. Stat. Data Anal. 43(4): 445-469 (2003)
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:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: