252
Voted
PKDD
16 years 23 days ago
2004 Springer 
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
248
click to vote
PKDD
16 years 23 days ago
2004 Springer
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
245
click to vote
PKDD
16 years 23 days ago
2004 Springer
Spam filtering is a text categorization task that has attracted significant attention due to the increasingly huge amounts of junk email on the Internet. While current best-pract...
239
click to vote
PKDD
16 years 23 days ago
2004 Springer 
Abstract. Orange (www.ailab.si/orange) is a suite for machine learning and data mining. It can be used though scripting in Python or with visual programming in Orange Canvas using ...
219
click to vote
PKDD
16 years 23 days ago
2004 Springer
We show how carefully crafted random matrices can achieve distance-preserving dimensionality reduction, accelerate spectral computations, and reduce the sample complexity of certai...
|
Data Mining