@article{journals/nrhm/NeubauerO11, added-at = {2012-02-06T00:00:00.000+0100}, author = {Neubauer, Nicolas and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/2300713ac0b6284882f5f51cd28986243/dblp}, ee = {http://dx.doi.org/10.1080/13614568.2011.598952}, interhash = {71ef70767a8e5881351d3ac4d7f79abe}, intrahash = {300713ac0b6284882f5f51cd28986243}, journal = {The New Review of Hypermedia and Multimedia}, keywords = {dblp}, number = 3, pages = {267-294}, title = {Tripartite community structure in social bookmarking data.}, url = {http://dblp.uni-trier.de/db/journals/nrhm/nrhm17.html#NeubauerO11}, volume = 17, year = 2011 } @article{journals/tnn/SeoBO03, added-at = {2011-12-16T00:00:00.000+0100}, author = {Seo, Sambu and Bode, Mathias and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/2fbe253d82413cdec56ec528eb076761b/dblp}, ee = {http://dx.doi.org/10.1109/TNN.2003.809407}, interhash = {84d45ed23776141533d8484e5c066184}, intrahash = {fbe253d82413cdec56ec528eb076761b}, journal = {IEEE Transactions on Neural Networks}, keywords = {dblp}, number = 2, pages = {390-398}, title = {Soft nearest prototype classification.}, url = {http://dblp.uni-trier.de/db/journals/tnn/tnn14.html#SeoBO03}, volume = 14, year = 2003 } @article{journals/corr/abs-1001-0921, added-at = {2011-12-05T00:00:00.000+0100}, author = {Jain, Brijnesh J. and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/2304cb641fb892b2e98b28a993f9a67c7/dblp}, ee = {http://arxiv.org/abs/1001.0921}, interhash = {a3fcbf0dd7e6471029bbd84a21185f98}, intrahash = {304cb641fb892b2e98b28a993f9a67c7}, journal = {CoRR}, keywords = {dblp}, title = {Graph Quantization}, url = {http://dblp.uni-trier.de/db/journals/corr/corr1001.html#abs-1001-0921}, volume = {abs/1001.0921}, year = 2010 } @article{journals/corr/abs-1001-0927, added-at = {2011-12-05T00:00:00.000+0100}, author = {Jain, Brijnesh J. and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/28e9c44b6f7f8ad7bfea99c1c1a0784a5/dblp}, ee = {http://arxiv.org/abs/1001.0927}, interhash = {72b877afa4b5602f458ba122db3cc98a}, intrahash = {8e9c44b6f7f8ad7bfea99c1c1a0784a5}, journal = {CoRR}, keywords = {dblp}, title = {Accelerating Competitive Learning Graph Quantization}, url = {http://dblp.uni-trier.de/db/journals/corr/corr1001.html#abs-1001-0927}, volume = {abs/1001.0927}, year = 2010 } @article{journals/corr/abs-1101-1266, added-at = {2011-12-05T00:00:00.000+0100}, author = {Jain, Brijnesh J. and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/27cb50b40431cf28ffd5f3d52c47cb66d/dblp}, ee = {http://arxiv.org/abs/1101.1266}, interhash = {0a182e2bec40177f649d9f66ee1b5af8}, intrahash = {7cb50b40431cf28ffd5f3d52c47cb66d}, journal = {CoRR}, keywords = {dblp}, title = {Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem}, url = {http://dblp.uni-trier.de/db/journals/corr/corr1101.html#abs-1101-1266}, volume = {abs/1101.1266}, year = 2011 } @article{journals/corr/abs-0912-4584, added-at = {2011-12-05T00:00:00.000+0100}, author = {Jain, Brijnesh J. and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/2f6bfab27f721f797cc1de0f1a6a5b25b/dblp}, ee = {http://arxiv.org/abs/0912.4584}, interhash = {487601199c9bada0f0855a8eaf7df334}, intrahash = {f6bfab27f721f797cc1de0f1a6a5b25b}, journal = {CoRR}, keywords = {dblp}, title = {A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem}, url = {http://dblp.uni-trier.de/db/journals/corr/corr0912.html#abs-0912-4584}, volume = {abs/0912.4584}, year = 2009 } @article{journals/corr/abs-0912-4598, added-at = {2011-12-05T00:00:00.000+0100}, author = {Jain, Brijnesh J. and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/20962df23706bf1f53281175c27470f10/dblp}, ee = {http://arxiv.org/abs/0912.4598}, interhash = {7e2bc139940f18a59693e95711d42293}, intrahash = {0962df23706bf1f53281175c27470f10}, journal = {CoRR}, keywords = {dblp}, title = {Elkan's k-Means for Graphs}, url = {http://dblp.uni-trier.de/db/journals/corr/corr0912.html#abs-0912-4598}, volume = {abs/0912.4598}, year = 2009 } @article{journals/corr/abs-1110-6317, added-at = {2011-12-05T00:00:00.000+0100}, author = {Shen, Yun and Grünewälder, Steffen and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/2850286e0efa0705bac12a07a8d22a1f2/dblp}, ee = {http://arxiv.org/abs/1110.6317}, interhash = {22db10673f17202994955575fd8dd4b0}, intrahash = {850286e0efa0705bac12a07a8d22a1f2}, journal = {CoRR}, keywords = {dblp}, title = {A Unified Framework for Risk-sensitive Markov Decision Processes with Finite State and Action Spaces}, url = {http://dblp.uni-trier.de/db/journals/corr/corr1110.html#abs-1110-6317}, volume = {abs/1110.6317}, year = 2011 } @article{journals/corr/abs-1109-4744, added-at = {2011-12-05T00:00:00.000+0100}, author = {Srinivasan, S. Deepak and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/2e830e708c1f6b082628ee7f3bf9c2d48/dblp}, ee = {http://arxiv.org/abs/1109.4744}, interhash = {d8abc2b2a31b5889a13a8c0123db095e}, intrahash = {e830e708c1f6b082628ee7f3bf9c2d48}, journal = {CoRR}, keywords = {dblp}, title = {Probabilistic prototype models for attributed graphs}, url = {http://dblp.uni-trier.de/db/journals/corr/corr1109.html#abs-1109-4744}, volume = {abs/1109.4744}, year = 2011 } @article{neubauer2009hyperincident, abstract = {Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of complex network analysis can be applied to examine their properties. One of the most basic tools, the analysis of connected components, however cannot be applied meaningfully: Tagging networks tend to be almost entirely connected. We therefore propose a generalization of connected components, m-hyperincident connected components. We show that decomposing tagging networks into 2-hyperincident connected components yields a characteristic component distribution with a salient giant component that can be found across various datasets. This pattern changes if the underlying formation process changes, for example, if the hypergraph is constructed from search logs, or if the tagging data is contaminated by spam: It turns out that the second- to 129th largest components of the spam-labeled Bibsonomy dataset are inhabited exclusively by spam users. Based on these findings, we propose and unsupervised method for spam detection.}, acmid = {1592398}, added-at = {2011-11-30T07:55:16.000+0100}, address = {New York, NY, USA}, articleno = {4}, author = {Neubauer, Nicolas and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/27ac6cd7d96cce39a5240ae4280f614b3/beate}, description = {Hyperincident connected components of tagging networks}, doi = {10.1145/1592394.1592398}, interhash = {2686bad7ff1f4d07c0b3302dff08368a}, intrahash = {7ac6cd7d96cce39a5240ae4280f614b3}, issn = {1931-1745}, issue = {Autumn}, journal = {SIGWEB Newsl.}, keywords = {bibsonomy-dataset networks spam tagging}, month = {September}, numpages = {10}, pages = {4:1--4:10}, publisher = {ACM}, title = {Hyperincident connected components of tagging networks}, url = {http://doi.acm.org/10.1145/1592394.1592398}, year = 2009 } @inproceedings{conf/webi/NeubauerSAO07, added-at = {2011-11-24T00:00:00.000+0100}, author = {Neubauer, Nicolas and Scheel, Christian and Albayrak, Sahin and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/29d2a5013b8ae1f80a9eb2cc92294beb3/dblp}, booktitle = {Web Intelligence}, crossref = {conf/webi/2007}, ee = {http://doi.ieeecomputersociety.org/10.1109/WI.2007.65}, interhash = {d04ef2c4c586b639ca262e388a8bc46b}, intrahash = {9d2a5013b8ae1f80a9eb2cc92294beb3}, isbn = {0-7695-3026-5}, keywords = {dblp}, pages = {607-613}, publisher = {IEEE Computer Society}, title = {Distance Measures in Query Space: How Strongly to Use Feedback From Past Queries.}, url = {http://dblp.uni-trier.de/db/conf/webi/webi2007.html#NeubauerSAO07}, year = 2007 } @article{journals/neco/HochreiterO06, added-at = {2011-11-17T00:00:00.000+0100}, author = {Hochreiter, Sepp and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/237b0973c05c329bb43d3f68cbe8d7067/dblp}, ee = {http://dx.doi.org/10.1162/neco.2006.18.6.1472}, interhash = {848917a9e59d233cd60ea6a7b5774b02}, intrahash = {37b0973c05c329bb43d3f68cbe8d7067}, journal = {Neural Computation}, keywords = {dblp}, number = 6, pages = {1472-1510}, title = {Support Vector Machines for Dyadic Data.}, url = {http://dblp.uni-trier.de/db/journals/neco/neco18.html#HochreiterO06}, volume = 18, year = 2006 } @article{journals/neco/PiepenbrockRO97, added-at = {2011-11-17T00:00:00.000+0100}, author = {Piepenbrock, Christian and Ritter, Helge and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/25ce4994d41d8bcf06921a39f37c72931/dblp}, ee = {http://dx.doi.org/10.1162/neco.1997.9.5.959}, interhash = {de57c9cbcdc62e6d8a2ed9af064e676e}, intrahash = {5ce4994d41d8bcf06921a39f37c72931}, journal = {Neural Computation}, keywords = {dblp}, number = 5, pages = {959-970}, title = {The Joint Development of Orientation and Ocular Dominance: Role of Constraints.}, url = {http://dblp.uni-trier.de/db/journals/neco/neco9.html#PiepenbrockRO97}, volume = 9, year = 1997 } @article{journals/neco/SeoO03, added-at = {2011-11-17T00:00:00.000+0100}, author = {Seo, Sambu and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/25fac0ef5146818367ab6bbf8424de906/dblp}, ee = {http://dx.doi.org/10.1162/089976603321891819}, interhash = {65540c9bde16eb1cf9dc68ded0227984}, intrahash = {5fac0ef5146818367ab6bbf8424de906}, journal = {Neural Computation}, keywords = {dblp}, number = 7, pages = {1589-1604}, title = {Soft Learning Vector Quantization.}, url = {http://dblp.uni-trier.de/db/journals/neco/neco15.html#SeoO03}, volume = 15, year = 2003 } @article{journals/neco/ErwinOS95, added-at = {2011-11-17T00:00:00.000+0100}, author = {Erwin, E. and Obermayer, Klaus and Schulten, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/20198d1d7021e31f517e261d6ba780c08/dblp}, ee = {http://dx.doi.org/10.1162/neco.1995.7.3.425}, interhash = {7fbd50e11f1d5b402b76558a3ddbc19f}, intrahash = {0198d1d7021e31f517e261d6ba780c08}, journal = {Neural Computation}, keywords = {dblp}, number = 3, pages = {425-468}, title = {Models of orientation and ocular dominance columns in the visual cortex: a critical comparison.}, url = {http://dblp.uni-trier.de/db/journals/neco/neco7.html#ErwinOS95}, volume = 7, year = 1995 } @article{journals/neco/ObermayerB97, added-at = {2011-11-17T00:00:00.000+0100}, author = {Obermayer, Klaus and Blasdel, Gary G.}, biburl = {http://www.bibsonomy.org/bibtex/21d419e2b30fe5085d2e525e963283316/dblp}, ee = {http://dx.doi.org/10.1162/neco.1997.9.3.555}, interhash = {676daabe7802afc80a182c6c0f917c6f}, intrahash = {1d419e2b30fe5085d2e525e963283316}, journal = {Neural Computation}, keywords = {dblp}, number = 3, pages = {555-575}, title = {Singularities in Primate Orientation Maps.}, url = {http://dblp.uni-trier.de/db/journals/neco/neco9.html#ObermayerB97}, volume = 9, year = 1997 } @article{journals/neco/MullerSHSBGCLO00, added-at = {2011-11-17T00:00:00.000+0100}, author = {Müller, T. and Stetter, Martin and Hübener, Mark and Sengpiel, F. and Bonhoeffer, Tobias and Gödecke, I. and Chapman, B. and Löwel, Siegrid and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/2076e49c648e8c2b48d9e2da0e1e87c72/dblp}, ee = {http://dx.doi.org/10.1162/089976600300014854}, interhash = {a15cff242c6dba996913f636bfc685ec}, intrahash = {076e49c648e8c2b48d9e2da0e1e87c72}, journal = {Neural Computation}, keywords = {dblp}, number = 11, pages = {2573-2595}, title = {An Analysis of Orientation and Ocular Dominance Patterns in the Visual Cortex of Cats and Ferrets.}, url = {http://dblp.uni-trier.de/db/journals/neco/neco12.html#MullerSHSBGCLO00}, volume = 12, year = 2000 } @article{journals/neco/GraepelO99, added-at = {2011-11-17T00:00:00.000+0100}, author = {Graepel, Thore and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/2f481cd227c297fa0b4d4e24e702ed625/dblp}, ee = {http://dx.doi.org/10.1162/089976699300016854}, interhash = {e99ea0c3eed1f18fb8346ba3f634ba81}, intrahash = {f481cd227c297fa0b4d4e24e702ed625}, journal = {Neural Computation}, keywords = {dblp}, number = 1, pages = {139-155}, title = {A Stochastic Self-Organizing Map for Proximity Data.}, url = {http://dblp.uni-trier.de/db/journals/neco/neco11.html#GraepelO99}, volume = 11, year = 1999 } @inproceedings{conf/nips/OnkenGO09, added-at = {2011-11-10T00:00:00.000+0100}, author = {Onken, Arno and Grünewälder, Steffen and Obermayer, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/2b7ed701eaf9aa1dc4a5c98c5f6351fb8/dblp}, booktitle = {NIPS}, crossref = {conf/nips/2009}, editor = {Bengio, Yoshua and Schuurmans, Dale and Lafferty, John D. and Williams, Christopher K. I. and Culotta, Aron}, ee = {http://books.nips.cc/papers/files/nips22/NIPS2009_0770.pdf}, interhash = {5b2474ba8826e2cfd59bbfa8119cbf40}, intrahash = {b7ed701eaf9aa1dc4a5c98c5f6351fb8}, isbn = {9781615679119}, keywords = {dblp}, pages = {1383-1391}, publisher = {Curran Associates, Inc.}, title = {Correlation Coefficients are Insufficient for Analyzing Spike Count Dependencies.}, url = {http://dblp.uni-trier.de/db/conf/nips/nips2009.html#OnkenGO09}, year = 2009 } @article{journals/pc/ObermayerRS90, added-at = {2011-09-09T00:00:00.000+0200}, author = {Obermayer, Klaus and Ritter, Helge and Schulten, Klaus}, biburl = {http://www.bibsonomy.org/bibtex/248ed26cbb0010602eacf5ef8c863cb00/dblp}, ee = {http://dx.doi.org/10.1016/0167-8191(90)90088-Q}, interhash = {9d814b61889aef4bcb5c24dbc8e35afb}, intrahash = {48ed26cbb0010602eacf5ef8c863cb00}, journal = {Parallel Computing}, keywords = {dblp}, number = 3, pages = {381-404}, title = {Large-scale simulations of self-organizing neural networks on parallel computers: application to biological modelling.}, url = {http://dblp.uni-trier.de/db/journals/pc/pc14.html#ObermayerRS90}, volume = 14, year = 1990 }