Sciweavers

1314 search results - page 29 / 263
» Approximate data mining in very large relational data
Sort
View
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
14 years 8 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
TKDE
1998
111views more  TKDE 1998»
13 years 8 months ago
Efficient Data Mining for Path Traversal Patterns
—In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects...
Ming-Syan Chen, Jong Soo Park, Philip S. Yu
PARCO
1997
13 years 9 months ago
Parallel Database Techniques in Decision Support and Data Mining
During the last decade, all commercial database systems have included features for parallel processing into their products. This development has been driven by the fact that datab...
Andreas Reuter
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
14 years 3 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu
WEBI
2009
Springer
14 years 3 months ago
Data Mining for Malicious Code Detection and Security Applications
: Data mining is the process of posing queries and extracting patterns, often previously unknown from large quantities of data using pattern matching or other reasoning techniques....
Bhavani M. Thuraisingham