General Tensor Spectral Co-clustering for Higher-Order Data

Tao Wu, Austin R. Benson, David F. Gleich

Nov-21-2025, 11:07:05 GMT–Neural Information Processing Systems

The algorithm takes as input a nonnegative tensor, which may be sparse, non-square, and asymmetric, and outputs subsets of indices from each dimension (co-clusters).

data mining, machine learning, tensor, (18 more...)

Neural Information Processing Systems

Nov-21-2025, 11:07:05 GMT

Conferences PDF

Country:
- Africa > Senegal
  - Kolda Region > Kolda (0.04)
- Asia
  - China > Beijing
    - Beijing (0.04)
  - Southeast Asia (0.04)
  - Taiwan (0.04)
- Europe
  - Germany (0.28)
  - Spain > Catalonia
    - Barcelona Province > Barcelona (0.04)
- North America
  - Mexico > Quintana Roo
    - Cancún (0.04)
  - United States > California
    - Santa Clara County > Palo Alto (0.04)
- Oceania (0.04)

Genre:
- Research Report (0.68)

Industry:
- Transportation > Air (0.93)

Technology:
- Information Technology
  - Artificial Intelligence
    - Machine Learning > Statistical Learning
      - Clustering (0.47)
    - Representation & Reasoning (1.00)
  - Data Science > Data Mining (0.69)

Duplicate Docs Excel Report

Title
General Tensor Spectral Co-clustering for Higher-Order Data
General Tensor Spectral Co-clustering for Higher-Order Data

Similar Docs Excel Report more

Title	Similarity	Source
None found