Sciweavers

4541 search results - page 128 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
SYNASC
2006
IEEE
106views Algorithms» more  SYNASC 2006»
15 years 9 months ago
A Quality Measure for Multi-Level Community Structure
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
Maylis Delest, Jean-Marc Fedou, Guy Melanço...
EVOW
2006
Springer
15 years 6 months ago
Mining Structural Databases: An Evolutionary Multi-Objetive Conceptual Clustering Methodology
Abstract. The increased availability of biological databases containing representations of complex objects permits access to vast amounts of data. In spite of the recent renewed in...
Rocío Romero-Záliz, Cristina Rubio-E...
PVLDB
2008
146views more  PVLDB 2008»
15 years 2 months ago
Resisting structural re-identification in anonymized social networks
We identify privacy risks associated with releasing network data sets and provide an algorithm that mitigates those risks. A network consists of entities connected by links repres...
Michael Hay, Gerome Miklau, David Jensen, Donald F...
BMCBI
2007
128views more  BMCBI 2007»
15 years 2 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
136
Voted
JAIR
2008
173views more  JAIR 2008»
15 years 2 months ago
Creating Relational Data from Unstructured and Ungrammatical Data Sources
In order for agents to act on behalf of users, they will have to retrieve and integrate vast amounts of textual data on the World Wide Web. However, much of the useful data on the...
Matthew Michelson, Craig A. Knoblock