Sciweavers

1314 search results - page 126 / 263
» Approximate data mining in very large relational data
Sort
View
RSFDGRC
2005
Springer
127views Data Mining» more  RSFDGRC 2005»
15 years 7 months ago
Hierarchical Information Maps
We discuss the problems of spatio-temporal reasoning in the context of hierarchical information maps and approximate reasoning networks (AR networks). Hierarchical information maps...
Andrzej Skowron, Piotr Synak
ICDE
1998
IEEE
187views Database» more  ICDE 1998»
16 years 3 months ago
Mining Optimized Association Rules with Categorical and Numeric Attributes
?Mining association rules on large data sets has received considerable attention in recent years. Association rules are useful for determining correlations between attributes of a ...
Rajeev Rastogi, Kyuseok Shim
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
14 years 11 months ago
Edge Weight Regularization over Multiple Graphs for Similarity Learning
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
Pradeep Muthukrishnan, Dragomir R. Radev, Qiaozhu ...
BMCBI
2010
132views more  BMCBI 2010»
15 years 1 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
ICICS
2007
Springer
15 years 5 months ago
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
Authentication is increasingly relevant to data management. Data is being outsourced to untrusted servers and clients want to securely update and query their data. For example, in ...
Charalampos Papamanthou, Roberto Tamassia