Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für biologische Kybernetik     Collection: Biologische Kybernetik     Display Documents



ID: 461764.0, MPI für biologische Kybernetik / Biologische Kybernetik
Multi-way set enumeration in real-valued tensors
Authors:Georgii, E.; Tsuda, K.; Schölkopf, B.
Editors:Ding, C.; Li, T.
Date of Publication (YYYY-MM-DD):2009-06
Title of Proceedings:Proceedings of the 2nd Workshop on Data Mining using Matrices and Tensors (DMMT 2009)
Start Page:32
End Page:41
Physical Description:10
Audience:Not Specified
Intended Educational Use:No
Abstract / Description:The analysis of n-ary relations receives attention in many different fields, for instance biology, web mining, and social
studies. In the basic setting, there are n sets of instances, and each observation associates n instances, one from each set.
A common approach to explore these n-way data is the search for n-set patterns. An n-set pattern consists of
specific subsets of the n instance sets such that all possible n-ary associations between the corresponding instances are
observed. This provides a higher-level view of the data, revealing associative relationships between groups of
instances. Here we generalize this approach in two aspects. First, we tolerate missing observations to a certain degree, thet means we
are also interested in n-sets where most (although not all) of the possible combinations have been recorded in the data.
Second, we take association weights into account. More precisely, we propose a method to enumerate all n-sets
that satisfy a minimum treshold with respect to the average association weight. Non-observed associations
obtain by default a weight of zero. Technically, we solve the enumeration task using a reverse search strategy,
which allows for effective pruning of search space. In addition, our algorithm provides a ranking of the solutions and can consider further constraints.
We show experimental results on artificial and real-world data sets from different domains.
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Holger Fischer
Affiliations:MPI für biologische Kybernetik/Empirical Inference (Dept. Schölkopf)
Identifiers:LOCALID:5932
URL:http://users.cs.fiu.edu/~taoli/kdd09-workshop/DMMT...
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.