Sciweavers

2878 search results - page 52 / 576
» Learning the Common Structure of Data
Sort
View
JDA
2006
184views more  JDA 2006»
13 years 8 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
COLT
2003
Springer
14 years 1 months ago
Learning from Uncertain Data
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ï¬...
Mehryar Mohri
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 years 6 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...
AAAI
2012
11 years 11 months ago
Manifold Warping: Manifold Alignment over Time
Knowledge transfer is computationally challenging, due in part to the curse of dimensionality, compounded by source and target domains expressed using different features (e.g., do...
Hoa Trong Vu, Clifton Carey, Sridhar Mahadevan
ICDE
2007
IEEE
96views Database» more  ICDE 2007»
14 years 11 days ago
Mining Software Data
Data mining techniques and machine learning methods are commonly used in several disciplines. It is possible that they could also provide a basis for quality assessment of softwar...
Burak Turhan, F. Onur Kutlubay