Sciweavers

387 search results - page 15 / 78
» Mining Approximative Descriptions of Sets Using Rough Sets
Sort
View
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
14 years 1 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
RSCTC
2004
Springer
144views Fuzzy Logic» more  RSCTC 2004»
14 years 1 months ago
Approximation Spaces and Information Granulation
Abstract. In this paper, we discuss approximation spaces in a granular computing framework. Such approximation spaces generalise the approaches to concept approximation existing in...
Andrzej Skowron, Roman W. Swiniarski, Piotr Synak
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 7 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
FUIN
2006
88views more  FUIN 2006»
13 years 7 months ago
Calculi of Approximation Spaces
This paper considers the problem of how to establish calculi of approximation spaces. Approximation spaces considered in the context of rough sets were introduced by Zdzislaw Pawla...
Andrzej Skowron, Jaroslaw Stepaniuk, James F. Pete...
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
14 years 1 months ago
Pruning Social Networks Using Structural Properties and Descriptive Attributes
Scale is often an issue with understanding and making sense of large social networks. Here we investigate methods for pruning social networks by determining the most relevant rela...
Lisa Singh, Lise Getoor, Louis Licamele