Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleDecember 2022
Deep learning-based computer aided diagnosis model for skin cancer detection and classification
Distributed and Parallel Databases (DAPD), Volume 40, Issue 4Pages 717–736https://doi.org/10.1007/s10619-021-07360-zAbstractSkin cancer is a commonly occurring disease, which affects people of all age groups. Automated detection of skin cancer is needed to decrease the death rate by identifying the diseases at the initial stage. The visual inspection during the medical ...
- research-articleDecember 2022
Research on network abnormal data flow mining based on improved cluster analysis
Distributed and Parallel Databases (DAPD), Volume 40, Issue 4Pages 797–813https://doi.org/10.1007/s10619-021-07353-yAbstractAiming at the problems of traditional methods that cannot adapt to the interference of noise or abnormal data, the data mining time is long, and the data mining accuracy is low, a network abnormal data stream mining method based on improved ...
- research-articleSeptember 2022
Recursive SQL and GPU-support for in-database machine learning
Distributed and Parallel Databases (DAPD), Volume 40, Issue 2-3Pages 205–259https://doi.org/10.1007/s10619-022-07417-7AbstractIn machine learning, continuously retraining a model guarantees accurate predictions based on the latest data as training input. But to retrieve the latest data from a database, time-consuming extraction is necessary as database systems have ...
- research-articleSeptember 2021
A kernel discriminant analysis for spatially dependent data
Distributed and Parallel Databases (DAPD), Volume 39, Issue 3Pages 583–606https://doi.org/10.1007/s10619-020-07309-8AbstractWe propose a novel supervised classification algorithm for spatially dependent data, built as an extension of kernel discriminant analysis, that we named Spatial Kernel Discriminant Analysis (SKDA). Our algorithm is based on a kernel estimate of ...
- articleMarch 2019
MDCUT2: a multi-density clustering algorithm with automatic detection of density variation in data with noise
Distributed and Parallel Databases (DAPD), Volume 37, Issue 1Pages 73–99https://doi.org/10.1007/s10619-018-7253-1Despite their adoption in many applications, density-based clustering algorithms perform inefficiently when dealing with data with varied density, imbricated and/or adjacent clusters. Clusters of lower density may be classified as outliers, and adjacent ...
- articleDecember 2015
Intra graph clustering using collaborative similarity measure
Distributed and Parallel Databases (DAPD), Volume 33, Issue 4Pages 583–603https://doi.org/10.1007/s10619-014-7170-xGraph is an extremely versatile data structure in terms of its expressiveness and flexibility to model a range of real life phenomenon. Various networks like social networks, sensor networks and computer networks are represented and stored in the form ...
- articleMarch 2015
Enabling community-driven information integration through clustering
Distributed and Parallel Databases (DAPD), Volume 33, Issue 1Pages 33–67https://doi.org/10.1007/s10619-014-7160-zIt has become widely recognized that user feedback can play a fundamental role in facilitating information integration tasks, e.g., the construction of integration schema and the specification of schema mappings. While promising, existing proposals make ...
- articleAugust 2010
MG-join: detecting phenomena and their correlation in high dimensional data streams
Distributed and Parallel Databases (DAPD), Volume 28, Issue 1Pages 67–92https://doi.org/10.1007/s10619-010-7065-4A phenomenon appears in a sensor network when a group of sensors continuously produces similar readings (i.e., data streams) over a period of time. This involves the processing of hundreds and maybe thousands of data streams in real-time. This paper ...
- articleDecember 2009
Efficient range query processing in metric spaces over highly distributed data
Distributed and Parallel Databases (DAPD), Volume 26, Issue 2-3Pages 155–180https://doi.org/10.1007/s10619-009-7047-6Similarity search in P2P systems has attracted a lot of attention recently and several important applications, like distributed image search, can profit from the proposed distributed algorithms. In this paper, we address the challenging problem of ...
- articleDecember 2008
Integrating semantically heterogeneous aggregate views of distributed databases
Distributed and Parallel Databases (DAPD), Volume 24, Issue 1-3Pages 73–94https://doi.org/10.1007/s10619-008-7031-6In statistical databases and data warehousing applications it is commonly the case that aggregate views are maintained as an underlying mechanism for summarising information. Where the databases or applications are distributed, or arise from independent ...
- articleDecember 2007
Semantics based customization of UBL document schemas
Distributed and Parallel Databases (DAPD), Volume 22, Issue 2-3Pages 107–131https://doi.org/10.1007/s10619-007-7014-zUniversal Business Language (UBL) is an OASIS initiative to develop common business document schemas to provide document interoperability in the eBusiness domain. Since the data requirements change according to a context, UBL schemas need to be ...
- articleFebruary 2007
Context-based matching for Web service composition
Distributed and Parallel Databases (DAPD), Volume 21, Issue 1Pages 5–37https://doi.org/10.1007/s10619-006-7003-7In this paper, we propose a novel matching framework for Web service composition. The framework combines the concepts of Web service, context, and ontology. We adopt a broad definition of context for Web services, encompassing all information needed for ...
- articleMay 2004
Query Size Estimation for Joins Using Systematic Sampling
Distributed and Parallel Databases (DAPD), Volume 15, Issue 3Pages 237–275https://doi.org/10.1023/B:DAPD.0000018573.35050.25We propose a new approach to the estimation of query result sizes for join queries. The technique, which we have called “systematic sampling—SYSSMP”, is a novel variant of the sampling-based approach. A key novelty of the systematic sampling is that it ...
- articleNovember 2003
Optimal Scheduling Algorithms for Tertiary Storage
Distributed and Parallel Databases (DAPD), Volume 14, Issue 3Pages 255–282https://doi.org/10.1023/A:1025589332623The ever growing needs of large multimedia systems cannot be met by magnetic disks due to their high cost and low storage density. Consequently, cheaper and denser tertiary storage systems are being integrated into the storage hierarchies of these ...
- articleJanuary 2003
VizCluster and its Application on Classifying Gene Expression Data
Distributed and Parallel Databases (DAPD), Volume 13, Issue 1Pages 73–97https://doi.org/10.1023/A:1021517806825Visualization enables us to find structures, features, patterns, and relationships in a dataset by presenting the data in various graphical forms with possible interactions. A visualization can provide a qualitative overview of large and complex ...
- articleOctober 1998
Solving Local Cost Estimation Problem for Global Query Optimization in Multidatabase Systems
Distributed and Parallel Databases (DAPD), Volume 6, Issue 4Pages 373–421https://doi.org/10.1023/A:1008603331221To meet users‘ growing needs for accessing pre-existing heterogeneous databases, a multidatabase system (MDBS) integrating multiple databases has attracted many researchers recently. A key feature of an MDBS is local autonomy. For a query retrieving data ...
- articleJuly 1997
A Survey of Distributed Database Checkpointing
Distributed and Parallel Databases (DAPD), Volume 5, Issue 3Pages 289–319https://doi.org/10.1023/A:1008689312900Checkpointing a database is a vital technique to reduce the recovery time in the presence of a failure. For distributed databases, checkpointing also provides an efficient way to perform global reconstruction. In this paper, we survey and classify previous ...