419 search results - page 22 / 84 » Using Matrix Decompositions in Formal Concept Analysis |
117
Voted
ICFCA
2009
Springer
14 years 10 months ago
2009
Springer
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 ...
124
click to vote
PET
2004
Springer
15 years 5 months ago
2004
Springer
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...
105
Voted
TCS
2008
15 years 10 days ago
2008
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 ...
121
click to vote
EDOC
2004
IEEE
15 years 4 months ago
2004
IEEE
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...
111
click to vote
SADM
2008
14 years 12 months ago
2008
: 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...