104 search results - page 19 / 21 » TRIPS and TIDES: new algorithms for tree mining |
KDD
2003
ACM
14 years 6 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
HIPEAC
2005
Springer
13 years 11 months ago
2005
Springer
ions Sebastian Pop 1 , Albert Cohen 2 , and Georges-Andr´e Silber 1 1 CRI, Mines Paris, Fontainebleau, France 2 ALCHEMY group, INRIA Futurs, Orsay, France Abstract. This paper pre...
ASIAMS
2007
IEEE
14 years 11 days ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
KDD
2006
ACM
14 years 6 months ago
2006
ACM
Typically, data collected by a spacecraft is downlinked to Earth and pre-processed before any analysis is performed. We have developed classifiers that can be used onboard a space...
KDD
2007
ACM
14 years 4 days ago
2007
ACM
Mixture models form one of the most widely used classes of generative models for describing structured and clustered data. In this paper we develop a new approach for the analysis...