Sciweavers

386 search results - page 73 / 78
» Extracting Support Data for a Given Task
Sort
View
RSCTC
2000
Springer
197views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
Rough Set Approach to CBR
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
Jan Wierzbicki
ECIR
2008
Springer
13 years 9 months ago
Clustering Template Based Web Documents
More and more documents on the World Wide Web are based on templates. On a technical level this causes those documents to have a quite similar source code and DOM tree structure. G...
Thomas Gottron
PODS
2010
ACM
306views Database» more  PODS 2010»
14 years 28 days ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
IJCNN
2007
IEEE
14 years 2 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 8 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...