1314 search results - page 109 / 263 » Approximate data mining in very large relational data |
139
Voted
DEXAW
2007
IEEE
15 years 3 months ago
2007
IEEE
Due to the lack of efficient native XML database management systems, XML data manipulation and query evaluation may be resource-consuming, and represent a bottleneck for several ...
120
click to vote
WWW
2006
ACM
16 years 2 months ago
2006
ACM
We present a novel model for validating and improving the content and structure organization of a website. This model studies the website as a graph and evaluates its interconnect...
115
click to vote
JCO
2010
15 years 5 days ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
133
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
As the World Wide Web in China grows rapidly, mining knowledge in Chinese Web pages becomes more and more important. Mining Web information usually relies on the machine learning ...
102
click to vote
ISBI
2004
IEEE
16 years 2 months ago
2004
IEEE
The surface Laplacian is known to be a theoretical reliable approximation of the cortical activity. Unfortunately, because of its high pass character and the relative low density ...