Sciweavers

903 search results - page 127 / 181
» Non-well-founded trees in categories
Sort
View
CALCO
2009
Springer
162views Mathematics» more  CALCO 2009»
15 years 8 months ago
Semantics of Higher-Order Recursion Schemes
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
Jirí Adámek, Stefan Milius, Jiri Vel...
CIKM
2007
Springer
15 years 8 months ago
Structure and semantics for expressive text kernels
Several problems in text categorization are too hard to be solved by standard bag-of-words representations. Work in kernel-based learning has approached this problem by (i) consid...
Stephan Bloehdorn, Alessandro Moschitti
CVPR
2008
IEEE
16 years 4 months ago
Semantic texton forests for image categorization and segmentation
We propose semantic texton forests, efficient and powerful new low-level features. These are ensembles of decision trees that act directly on image pixels, and therefore do not ne...
Jamie Shotton, Matthew Johnson, Roberto Cipolla
ICNC
2005
Springer
15 years 7 months ago
An Improved Method of Feature Selection Based on Concept Attributes in Text Classification
The feature selection and weighting are two important parts of automatic text classification. In this paper we give a new method based on concept attributes. We use the DEF Terms o...
Shasha Liao, Minghu Jiang
SAC
2004
ACM
15 years 7 months ago
An optimized approach for KNN text categorization using P-trees
The importance of text mining stems from the availability of huge volumes of text databases holding a wealth of valuable information that needs to be mined. Text categorization is...
Imad Rahal, William Perrizo