4850 search results - page 623 / 970 » Approximate Data Structures with Applications |
160
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
167
click to vote
PPSN
1994
Springer
15 years 10 months ago
1994
Springer
The Reproductive Plan Language 2 (RPL2) is an extensible interpreted language for writing and using evolutionary computing programs. It supports arbitrary genetic representations,...
198
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
182
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
187
click to vote
ICDM
2008
IEEE
16 years 28 days ago
2008
IEEE
In recent years, co-clustering has emerged as a powerful data mining tool that can analyze dyadic data connecting two entities. However, almost all existing co-clustering techniqu...