We combine linear discriminant analysis (LDA) and K-means clustering into a coherent framework to adaptively select the most discriminative subspace. We use K-means clustering to ...
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
This paper presents a morphological scale-space approach to the problem of feature extraction. The method relies on two steps: a hierarchical simplification step based on pyramids...
Organizations are adopting multiple best practices models to improve overall performance. Their objective is to capture the cumulative added value of each model into one single env...
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...