Sciweavers

535 search results - page 49 / 107
» Online learning over graphs
Sort
View
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
15 years 9 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
ISWC
2003
IEEE
15 years 9 months ago
Unsupervised, Dynamic Identification of Physiological and Activity Context in Wearable Computing
Context-aware computing describes the situation where a wearable / mobile computer is aware of its user’s state and surroundings and modifies its behavior based on this informat...
Andreas Krause, Daniel P. Siewiorek, Asim Smailagi...
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
15 years 7 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo
WEBDB
2010
Springer
178views Database» more  WEBDB 2010»
15 years 9 months ago
Using Latent-Structure to Detect Objects on the Web
An important requirement for emerging applications which aim to locate and integrate content distributed over the Web is to identify pages that are relevant for a given domain or ...
Luciano Barbosa, Juliana Freire
CSR
2007
Springer
15 years 10 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka