Pages that link to "Item:Q5891450"
From MaRDI portal
The following pages link to Mathematical tools for data mining. Set theory, partial orders, combinatorics (Q5891450):
Displaying 19 items.
- Notions from rough set theory in a generalized dependency relation context (Q1644893) (← links)
- Pairings and related symmetry notions (Q1989479) (← links)
- New perspectives of granular computing in relation geometry induced by pairings (Q2000596) (← links)
- Dependency relations (Q2011325) (← links)
- Some classes of abstract simplicial complexes motivated by module theory (Q2196332) (← links)
- A partial ordering approach to characterize properties of a pair of orthogonal projectors (Q2243056) (← links)
- Lattice representations with set partitions induced by pairings (Q2290345) (← links)
- The granular partition lattice of an information table (Q2293047) (← links)
- The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
- On solving the sum-of-ratios problem (Q2422872) (← links)
- Rough sets on graphs: New dependency and accuracy measures (Q4554547) (← links)
- Generalized Nets as a Tool for the Modelling of Data Mining Processes (Q4558949) (← links)
- Ultrametricity of Dissimilarity Spaces and Its Significance for Data Mining (Q5016653) (← links)
- Indiscernibility structures induced from function sets : Graph and digraph case (Q5031926) (← links)
- Locally finite complexes, modules and generalized information systems (Q5073316) (← links)
- Some classifications of graphs with respect to a set adjacency relation (Q5859499) (← links)
- Granular computing on basic digraphs (Q5866244) (← links)
- Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners (Q6632119) (← links)
- Categorical interpretations of cryptomorphisms and maps arising from matroidal and combinatorial contexts (Q6667405) (← links)
