Amanote Research

Amanote Research

    RegisterSign In

Parameter-Free Hierarchical Co-Clustering by N-Ary Splits

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-04180-8_55
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2009

Authors
Dino IencoRuggero G. PensaRosa Meo
Publisher

Springer Berlin Heidelberg


Related search

Hierarchical Co-Clustering: Off-Line and Incremental Approaches

Data Mining and Knowledge Discovery
Computer NetworksComputer Science ApplicationsInformation SystemsCommunications
2012English

Hierarchical Clustering

English

Hierarchical Clustering

2018English

PFClust: An Optimised Implementation of a Parameter-Free Clustering Algorithm

Source Code for Biology and Medicine
Computer Science ApplicationsInformation SystemsManagementHealth Informatics
2014English

Information Theoretic Hierarchical Clustering

Entropy
Electronic EngineeringInformation SystemsMathematical PhysicsElectricalAstronomyPhysics
2011English

N-Ary Decomposition for Multi-Class Classification

Machine Learning
Artificial IntelligenceSoftware
2019English

Hierarchical Clustering Using Constraints

English

Constraint Programming for Mining N-Ary Patterns

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Properties of Strong Dependance N-Ary Semigroups

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy