Sciweavers

419 search results - page 22 / 84
» Using Matrix Decompositions in Formal Concept Analysis
Sort
View
ICFCA
2009
Springer
13 years 5 months ago
A Concept Lattice-Based Kernel for SVM Text Classification
Abstract. Standard Support Vector Machines (SVM) text classification relies on bag-of-words kernel to express the similarity between documents. We show that a document lattice can ...
Claudio Carpineto, Carla Michini, Raffaele Nicolus...
PET
2004
Springer
14 years 1 months ago
A Formal Privacy System and Its Application to Location Based Services
There are a variety of well-known models for access control developed for purposes like formally modeling the access rights on files, databases, and web resources. However, the ex...
Carl A. Gunter, Michael J. May, Stuart G. Stubbleb...
TCS
2008
13 years 7 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer
EDOC
2004
IEEE
13 years 11 months ago
Formalizing ODP Computational Viewpoint Specifications in Maude
The ODP computational viewpoint describes the functionality of a system and its environment, in terms of a configuration of objects which interact at interfaces. Computational obj...
José Raúl Romero, Antonio Vallecillo
SADM
2008
178views more  SADM 2008»
13 years 7 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon