Our Sponsors
Category SIMBAD 2011
Deadline: May 15, 2011 | Date: September 28, 2011-October 02, 2011
Venue/Country: Venice, Italy
Updated: 2011-02-22 12:18:32 (GMT+9)
MOTIVATIONS AND OBJECTIVESTraditional pattern recognition techniques are intimately linked tothe notion of "feature spaces." Adopting this view, each object isdescribed in terms of a vector of numerical attributes and istherefore mapped to a point in a Euclidean (geometric) vector space sothat the distances between the points reflect the observed(dis)similarities between the respective objects. This kind ofrepresentation is attractive because geometric spaces offer powerfulanalytical as well as computational tools that are simply notavailable in other representations. Indeed, classical patternrecognition methods are tightly related to geometrical concepts andnumerous powerful tools have been developed during the last fewdecades, starting from the maximal likelihood method in the 1920's, toperceptrons in the 1960's, to kernel machines in the 1990's.However, the geometric approach suffers from a major intrinsiclimitation, which concerns the representational power of vectorial,feature-based descriptions. In fact, there are numerous applicationdomains where either it is not possible to find satisfactory featuresor they are inefficient for learning purposes. This modelingdifficulty typically occurs in cases when experts cannot definefeatures in a straightforward way (e.g., protein descriptors vs.alignments), when data are high dimensional (e.g., images), whenfeatures consist of both numerical and categorical variables (e.g.,person data, like weight, sex, eye color, etc.), and in the presenceof missing or inhomogeneous data. But, probably, this situation arisesmost commonly when objects are described in terms of structuralproperties, such as parts and relations between parts, as is the casein shape recognition.In the last few years, interest around purely similarity-basedtechniques has grown considerably. For example, within the supervisedlearning paradigm (where expert-labeled training data is assumed to beavailable), the well-established kernel-based methods shift the focus from thechoice of an appropriate set of features to the choice of a suitablekernel, which is related to object similarities. However, this shiftof focus is only partial, as the classical interpretation of thenotion of a kernel is that it provides an implicit transformation ofthe feature space rather than a purely similarity-basedrepresentation. Similarly, in the unsupervised domain, there has beenan increasing interest around pairwise or even multiway algorithms,such as spectral and graph-theoretic clustering methods, which avoidthe use of features altogether.By departing from vector-space representations one is confronted withthe challenging problem of dealing with (dis)similarities that do notnecessarily possess the Euclidean behavior or not even obey therequirements of a metric. The lack of the Euclidean and/or metricproperties undermines the very foundations of traditional patternrecognition theories and algorithms, and poses totally newtheoretical/computational questions and challenges.The workshop will mark the end of the EU FP7 Projects SIMBAD(http://simbad-fp7.eu
), which was devoted precisely to these themes,and is a follow-up of the ICML 2010 Workshop on "Learning innon-(geo)metric spaces" (http://www.dsi.unive.it/~icml2010lngs
). Itsaim is to consolidate research efforts in this area, and to provide aninformal discussion forum for researchers and practitioners interestedin this important yet diverse subject. The discussion will revolvearound two main themes, which basically correspond to the twofundamental questions that arise when abandoning the realm ofvectorial, feature-based representations, namely:- How can one obtain suitable similarity information from datarepresentations that are more powerful than, or simply different from,the vectorial?- How can one use similarity information in order to perform learningand classification tasks?We aim at covering a wide range of problems and perspectives, fromsupervised to unsupervised learning, from generative to discriminativemodels, and from theoretical issues to real-world practicalapplications.Accordingly, topics of interest include (but are not limited to):- Embedding and embeddability- Graph spectra and spectral geometry- Indefinite and structural kernels- Game-theoretic models of pattern recognition- Characterization of non-(geo)metric behaviour- Foundational issues- Measures of (geo)metric violations- Learning and combining similarities- Multiple-instance learning- ApplicationsFORMATThe workshop will feature contributed talks and posters as well asinvited presentations. We feel that the more informal the better, andwe would like to solicit open and lively discussions and exchange ofideas from researchers with different backgrounds and perspectives.Plenty of time will be allocated to questions, discussions, andbreaks.We plan to get videolectures coverage.ORGANIZATIONProgram ChairsMarcello Pelillo, University of Venice, ItalyEdwin Hancock, University of York, UKSteering CommitteeJoachim Buhmann, ETH Zurich, SwitzerlandRobert Duin, Delft University of Technology, The NetherlandsMario Figueiredo, Technical University of Lisbon, PortugalEdwin Hancock, University of York, UKVittorio Murino, University of Verona, ItalyMarcello Pelillo (chair), University of Venice, ItalyProgram CommitteeMaria-Florina Balcan, Georgia Institute of Technology, USAJoachim Buhmann, ETH Zurich, SwitzerlandHorst Bunke, University of Bern, SwitzerlandTiberio Caetano, NICTA, AustraliaUmberto Castellani, University of Verona, ItalyLuca Cazzanti, University of Washington, Seattle, USANicolo' Cesa-Bianchi, University of Milan, ItalyRobert Duin, Delft University of Technology, The NetherlandsFrancisco Escolano, University of Alicante, SpainMario Figueiredo, Technical University of Lisbon, PortugalAna Fred, Technical University of Lisbon, PortugalBernard Haasdonk, University of Stuttgart, GermanyEdwin Hancock, University of York, UKAnil Jain, Michigan State University, USARobert Krauthgamer, Weizmann Institute of Science, IsraelMarco Loog, Delft University of Technology, The NetherlandsVittorio Murino, University of Verona, ItalyElzbieta Pekalska, University of Manchester, UKMarcello Pelillo, University of Venice, ItalyMassimiliano Pontil, University College London, UKAntonio Robles-Kelly, NICTA, AustraliaVolker Roth, University of Basel, SwitzerlandAmnon Shashua, Hebrew University of Jerusalem, IsraelAndrea Torsello, University of Venice, ItalyRichard Wilson, University of York, UKOrganization CommitteeSamuel Rota Bulo' (chair), University of Venice, ItalyNicola Rebagliati, University of Venice, ItalyLuca Rossi, University of Venice, ItalyTeresa Scantamburlo, University of Venice, ItalyIMPORTANT DATESPaper submission: May 15, 2011Notifications: June 19, 2011Camera-ready due: July 2011Conference: September 28-30, 2011PAPER SUBMISSIONPapers must be submitted electronically at the conference websiteusing the EasyChair submission system. Manuscripts should be in pdfand formatted according to Springer's Lecture Notes in ComputerScience (LNCS) style. Information concerning typesetting can beobtained directly from Springer at:http://www.springer.com/comp/lncs/authors.html
.Papers must not exceed 16 pages and should report original work.All submitted papers will be subject to a rigorous peer-reviewprocess. Accepted papers will appear in the workshop proceedings,which will be published in Springer's Lecture Notes in ComputerScience (LNCS) series.Submission implies the willingness of at least one of the authors toregister and present the paper, if accepted.Keywords: Accepted papers list. Acceptance Rate. EI Compendex. Engineering Index. ISTP index. ISI index. Impact Factor.
Disclaimer: ourGlocal is an open academical resource system, which anyone can edit or update. Usually, journal information updated by us, journal managers or others. So the information is old or wrong now. Specially, impact factor is changing every year. Even it was correct when updated, it may have been changed now. So please go to Thomson Reuters to confirm latest value about Journal impact factor.