Sciweavers

4536 search results - page 119 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICDM
2010
IEEE
119views Data Mining» more  ICDM 2010»
13 years 7 months ago
Visually Controllable Data Mining Methods
A large number of data mining methods are, as such, not applicable to fast, intuitive, and interactive use. Thus, there is a need for visually controllable data mining methods. Suc...
Kai Puolamäki, Panagiotis Papapetrou, Jefrey ...
SIGOPS
2010
162views more  SIGOPS 2010»
13 years 7 months ago
Visual and algorithmic tooling for system trace analysis: a case study
Despite advances in the application of automated statistical and machine learning techniques to system log and trace data there will always be a need for human analysis of machine...
Wim De Pauw, Steve Heisig
PAMI
2008
197views more  PAMI 2008»
13 years 9 months ago
LEGClust - A Clustering Algorithm Based on Layered Entropic Subgraphs
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
Jorge M. Santos, Joaquim Marques de Sá, Lu&...
JODS
2007
102views Data Mining» more  JODS 2007»
13 years 9 months ago
Default Clustering with Conceptual Structures
This paper describes a theoretical framework for inducing knowledge from incomplete data sets. The general framework can be used with any formalism based on a lattice structure. It...
Julien Velcin, Jean-Gabriel Ganascia
SEMWEB
2010
Springer
13 years 7 months ago
Linking and Building Ontologies of Linked Data
The Web of Linked Data is characterized by linking structured data from different sources using equivalence statements, such as owl:sameAs, as well as other types of linked propert...
Rahul Parundekar, Craig A. Knoblock, José L...