Sciweavers

35 search results - page 3 / 7
» Computing with words and its relationships with fuzzistics
Sort
View
CORR
2002
Springer
95views Education» more  CORR 2002»
13 years 7 months ago
Unsupervised Learning of Morphology without Morphemes
The first morphological learner based upon the theory of Whole Word Morphology (Ford et al., 1997) is outlined, and preliminary evaluation results are presented. The program, Whol...
Sylvain Neuvel, Sean A. Fulop
IWSOS
2007
Springer
14 years 1 months ago
Automated Trust Negotiation in Autonomic Environments
Autonomic computing environments rely on devices that are able to make intelligent decisions without human supervision. Automated Trust Negotiation supports the cooperation of devi...
Andreas Klenk, Frank Petri, Benoit Radier, Mika&eu...
AAIM
2006
Springer
94views Algorithms» more  AAIM 2006»
14 years 1 months ago
Some Basics on Tolerances
In this note we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (Σ, Π, MA...
Boris Goldengorin, Gerold Jäger, Paul Molitor
ACSC
2009
IEEE
14 years 2 months ago
A ConceptLink Graph for Text Structure Mining
Most text mining methods are based on representing documents using a vector space model, commonly known as a bag of word model, where each document is modeled as a linear vector r...
Rowena Chau, Ah Chung Tsoi, Markus Hagenbuchner, V...
SDM
2011
SIAM
370views Data Mining» more  SDM 2011»
12 years 10 months ago
Sparse Latent Semantic Analysis
Latent semantic analysis (LSA), as one of the most popular unsupervised dimension reduction tools, has a wide range of applications in text mining and information retrieval. The k...
Xi Chen, Yanjun Qi, Bing Bai, Qihang Lin, Jaime G....