Sciweavers

4237 search results - page 610 / 848
» A Data Model for XML Databases
Sort
View
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
15 years 10 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
SIGMOD
2010
ACM
151views Database» more  SIGMOD 2010»
15 years 4 months ago
Exploring schema similarity at multiple resolutions
Large, dynamic, and ad-hoc organizations must frequently initiate data integration and sharing efforts with insufficient awareness of how organizational data sources are related. ...
Ken Smith, Craig Bonaceto, Chris Wolf, Beth Yost, ...
IDA
2007
Springer
15 years 10 months ago
Relational Algebra for Ranked Tables with Similarities: Properties and Implementation
The paper presents new developments in an extension of Codd’s relational model of data. The extension consists in equipping domains of attribute values with a similarity relation...
Radim Belohlávek, Stanislav Opichal, Vil&ea...
BMCBI
2010
172views more  BMCBI 2010»
15 years 4 months ago
Inferring gene regression networks with model trees
Background: Novel strategies are required in order to handle the huge amount of data produced by microarray technologies. To infer gene regulatory networks, the first step is to f...
Isabel A. Nepomuceno-Chamorro, Jesús S. Agu...
EDBT
2008
ACM
124views Database» more  EDBT 2008»
16 years 4 months ago
An efficient clustering method for k-anonymization
The k-anonymity model is a privacy-preserving approach that has been extensively studied for the past few years. To minimize the information loss due to anonymization, it is cruci...
Jun-Lin Lin, Meng-Cheng Wei