datasets:ior
Differences
This shows you the differences between two versions of the page.
|
datasets:ior [2016/04/21 16:27] c7031007 |
datasets:ior [2018/09/03 19:35] |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ==== Innsbruck Object Relation Dataset ==== | ||
| - | This dataset contains the set of possible object-object spatial relations. Learning object-object relations is a difficult problem with sparse, noisy, corrupted and incomplete information which makes it an interesting and challenging machine problem. We treated this problem as the learning missing edges in a multigraph problem. | ||
| - | |||
| - | **Keywords**: missing link prediction, data inputation, matrix completion, recommender systems, low-rank approximation | ||
| - | |||
| - | |||
| - | {{ :research:projects:squirrel:edges.png?600 |}} | ||
| - | |||
| - | The learning scenario based on which this database was created is a toy clean-up task in a room of kids, where an | ||
| - | agent needs to plan how to transform a messy child's room into a tidy one by moving objects to their storage locations and creating order. An agent can integrate knowledge on possible spatial relations of objects into the planning process and use it to re new the world model. Large numbers of objects and their potential interactions in this scenario make this task a large-scale problem. Estimating the missing relations based on those already known can accelerate planning procedures. | ||
| - | |||
| - | {{research:projects:squirrel:table.png?300}} {{:research:projects:squirrel:drawing.png?300|}} | ||
| - | {{:research:projects:squirrel:m99.jpg?300|}} | ||
| - | |||
| - | **Dataset Features** | ||
| - | |||
| - | *Dataset is generated based on the [[http://shape.cs.princeton.edu/benchmark/|Princeton Shape Benchmark database]] | ||
| - | *Dataset contains 4 sets for the each possible connection between objects (//in//, //on//, //below// and //next to//). The problem is formulated that all possible relations should be treated so two objects can have mulitple connections. | ||
| - | *Links between objects are determined by values: | ||
| - | ***0** - no connection | ||
| - | ***1** - direct connection | ||
| - | ***-1** - reverse connection | ||
| - | ***empty** - unknown connection | ||
| - | * You can downlaoad dataset [[https://iis.uibk.ac.at/public/databases/esann2015/|here]] | ||
| - | |||
| - | **Reference** | ||
| - | |||
| - | "//Learning missing edges via kernels in partially-known graphs//", Senka Krivic, Sandor Szedmak, Hanchen Xiong, Justus Piater, European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning 2015. [[https://iis.uibk.ac.at/public/papers/Krivic-2015-ESANN.pdf|PDF]] | ||
| - | Please cite this paper if you are using this dataset. | ||
| - | |||
| - | **BibTex** | ||
| - | |||
| - | @InProceedings{Krivic-2015-ESANN, | ||
| - | title = {{Learning missing edges via kernels in partially-known graphs}}, | ||
| - | author = {Krivi\'{c}, Senka and Szedmak, Sandor and Xiong, Hanchen and Piater, Justus}, | ||
| - | booktitle = {{European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning}}, | ||
| - | year = 2015, | ||
| - | url = {https://iis.uibk.ac.at/public/papers/Krivic-2015-ESANN.pdf} | ||
| - | } | ||
| - | |||
| - | **Acknowledgement** | ||
| - | |||
| - | This research has received funding from the European Community’s Seventh Framework Programme FP7/2007-2013 (Speci c Programme Cooperation, Theme 3,Information and Communication Technologies) under grant agreement no. 610532, [[http://www.squirrel-project.eu/|Squirrel]] and no. 270273, [[http://www.xperience.org/|Xperience]]. | ||
| - | |||
| - | **Contact** | ||
| - | [[senka.krivic@uibk.ac.at]] | ||
datasets/ior.txt · Last modified: 2018/09/03 19:35 (external edit)