<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://www.bibsonomy.org/tag/similarity"><title>BibSonomy publications for /tag/similarity</title><link>http://www.bibsonomy.org/publrss/tag/similarity</link><description>BibSonomy RSS Feed for /tag/similarity</description><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25fab0cb8f4674ad4ce86f9385d81b489/deynard"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2dd97ab549178f7a3c7b59d78ec1c6145/iccs"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f3560b755944a90e1d55d2621ec45f22/chriskoerner"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/265ac931186e0c5a01933979ff40860d7/brazovayeye"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2727ca39be34efa03d9ee011b285fc8ce/brazovayeye"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/208bda03312e509fa56968d1b63bbc3ae/brazovayeye"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2c537658326d287418ed08e6c1f67f062/brazovayeye"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f5ecf8c5873a25ce74abd39b97db6b70/brazovayeye"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/278fd64c3db55e6387ebdeb6c40054542/michi"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/241cf51d129fc591b564ebb30f807cea0/dzibold"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2773c9b4aea2fb9d479039ae409ac3fa8/mkroell"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2275778901efecbb122cb8b9ca8ad9311/mkroell"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/22f250404994a287160f00ef1e8a631ac/eswc2008"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/242b4c94cff05ccef031235d661a7a77a/suhara"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25fc2af573c43a5c37d31437ced7b5272/dzibold"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/278fd64c3db55e6387ebdeb6c40054542/steff83"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/278fd64c3db55e6387ebdeb6c40054542/suhara"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/26ea5fc946fbc5a95833cc4d3ebfd2247/dzibold"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2790a9e4822008cbbddac6d00cc7d032d/dzibold"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20f20efb2758d04df582586de416bb0fb/dzibold"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/25fab0cb8f4674ad4ce86f9385d81b489/deynard"><title>WordNet: : Similarity - Measuring the Relatedness of Concepts.</title><link>http://www.bibsonomy.org/bibtex/25fab0cb8f4674ad4ce86f9385d81b489/deynard</link><dc:creator>deynard</dc:creator><dc:date>2008-09-01T03:59:12+02:00</dc:date><dc:subject>wordnet similarity </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Ted &lt;a href=&#034;http://www.bibsonomy.org/author/Pedersen&#034;&gt;Pedersen&lt;/a&gt;  und Siddharth &lt;a href=&#034;http://www.bibsonomy.org/author/Patwardhan&#034;&gt;Patwardhan&lt;/a&gt;  und Jason &lt;a href=&#034;http://www.bibsonomy.org/author/Michelizzi&#034;&gt;Michelizzi&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;AAAI, &lt;/em&gt;&lt;em&gt;Seite1024-1025. &lt;/em&gt;(&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/wordnet"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2dd97ab549178f7a3c7b59d78ec1c6145/iccs"><title>Concept Similarity and Related Categories in SearchSleuth</title><link>http://www.bibsonomy.org/bibtex/2dd97ab549178f7a3c7b59d78ec1c6145/iccs</link><dc:creator>iccs</dc:creator><dc:date>2008-08-06T15:25:31+02:00</dc:date><dc:subject>formal fca categories similarity related analysis iccs concept 2008 searchsleuth </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Frithjof &lt;a href=&#034;http://www.bibsonomy.org/author/Dau&#034;&gt;Dau&lt;/a&gt;  und Jon &lt;a href=&#034;http://www.bibsonomy.org/author/Ducrou&#034;&gt;Ducrou&lt;/a&gt;  und Peter W. &lt;a href=&#034;http://www.bibsonomy.org/author/Eklund&#034;&gt;Eklund&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of the 16th International Conference on Conceptual Structures (ICCS 2008), &lt;/em&gt;&lt;em&gt;Volume5113vonLecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;Seite255-268. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2008&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/formal"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/fca"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/categories"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/related"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analysis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/iccs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/concept"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/2008"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/searchsleuth"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f3560b755944a90e1d55d2621ec45f22/chriskoerner"><title>Information Retrieval, 2nd edition</title><link>http://www.bibsonomy.org/bibtex/2f3560b755944a90e1d55d2621ec45f22/chriskoerner</link><dc:creator>chriskoerner</dc:creator><dc:date>2008-07-17T14:45:35+02:00</dc:date><dc:subject>informationretrieval similarity </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;C. J. &lt;a href=&#034;http://www.bibsonomy.org/author/Van Rijsbergen&#034;&gt;Van Rijsbergen&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Dept. of Computer Science, University of Glasgow, &lt;/em&gt;&lt;em&gt;Second Edition, &lt;/em&gt;(&lt;em&gt;1979&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/informationretrieval"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/265ac931186e0c5a01933979ff40860d7/brazovayeye"><title>Searching for discrimination rules in protease proteolytic cleavage activity using genetic programming with a min-max scoring function</title><link>http://www.bibsonomy.org/bibtex/265ac931186e0c5a01933979ff40860d7/brazovayeye</link><dc:creator>brazovayeye</dc:creator><dc:date>2008-06-19T17:35:00+02:00</dc:date><dc:subject>programming, analysis acid cleavage matrix, Polish Proteolytic genetic notation, The similarity Amino algorithms, reverse </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Zheng Rong &lt;a href=&#034;http://www.bibsonomy.org/author/Yang&#034;&gt;Yang&lt;/a&gt;  und Rebecca &lt;a href=&#034;http://www.bibsonomy.org/author/Thomson&#034;&gt;Thomson&lt;/a&gt;  und T. &lt;a href=&#034;http://www.bibsonomy.org/author/Charles Hodgman&#034;&gt;Charles Hodgman&lt;/a&gt;  und Jonathan &lt;a href=&#034;http://www.bibsonomy.org/author/Dry&#034;&gt;Dry&lt;/a&gt;  und Austin K. &lt;a href=&#034;http://www.bibsonomy.org/author/Doyle&#034;&gt;Doyle&lt;/a&gt;  und Ajit &lt;a href=&#034;http://www.bibsonomy.org/author/Narayanan&#034;&gt;Narayanan&lt;/a&gt;  und XiKun &lt;a href=&#034;http://www.bibsonomy.org/author/Wu&#034;&gt;Wu&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Biosystems&lt;/em&gt;&lt;em&gt;72(1-2):159--176&lt;/em&gt;&lt;em&gt;November2003. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analysis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/acid"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/cleavage"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/matrix,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Polish"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Proteolytic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/genetic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/notation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/The"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Amino"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithms,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/reverse"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2727ca39be34efa03d9ee011b285fc8ce/brazovayeye"><title>Computational intelligence techniques: a study of scleroderma skin disease</title><link>http://www.bibsonomy.org/bibtex/2727ca39be34efa03d9ee011b285fc8ce/brazovayeye</link><dc:creator>brazovayeye</dc:creator><dc:date>2008-06-19T17:35:00+02:00</dc:date><dc:subject>genomics, algorithms, Swarm mining Optimisation, grid Particle scleroderma differential structure rough genetic data disease, optimisation, visual preservation, virtual evolutionary-classical hybrid reality, similarity computing, programming, sets, evolution, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Julio J. &lt;a href=&#034;http://www.bibsonomy.org/author/Valdes&#034;&gt;Valdes&lt;/a&gt;  und Alan J. &lt;a href=&#034;http://www.bibsonomy.org/author/Barton&#034;&gt;Barton&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Late breaking paper at Genetic and Evolutionary Computation Conference (GECCO&#039;2007), &lt;/em&gt;&lt;em&gt;Seite2580--2587. &lt;/em&gt;&lt;em&gt;London, United Kingdom, &lt;/em&gt;&lt;em&gt;ACM Press, &lt;/em&gt;&lt;em&gt;7-11 July2007. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/genomics,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithms,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Swarm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Optimisation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/grid"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Particle"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/scleroderma"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/differential"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/structure"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/rough"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/genetic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/data"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/disease,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/optimisation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/visual"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/preservation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/virtual"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolutionary-classical"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/hybrid"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/reality,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/computing,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sets,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolution,"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/208bda03312e509fa56968d1b63bbc3ae/brazovayeye"><title>Evolving similarity coefficients for the solution of cellular manufacturing problems</title><link>http://www.bibsonomy.org/bibtex/208bda03312e509fa56968d1b63bbc3ae/brazovayeye</link><dc:creator>brazovayeye</dc:creator><dc:date>2008-06-19T17:35:00+02:00</dc:date><dc:subject>applications similarity engineering algorithms, formation, coefficients, genetic cell programming, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Christos &lt;a href=&#034;http://www.bibsonomy.org/author/Dimopoulos&#034;&gt;Dimopoulos&lt;/a&gt;  und Neil &lt;a href=&#034;http://www.bibsonomy.org/author/Mort&#034;&gt;Mort&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of the Congress on Evolutionary Computation (CEC 2000), &lt;/em&gt;&lt;em&gt;Seite617--624. &lt;/em&gt;&lt;em&gt;La Jolla Marriott Hotel La Jolla, California, USA, &lt;/em&gt;&lt;em&gt;IEEE Press, &lt;/em&gt;&lt;em&gt;6-9 July2000. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/applications"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/engineering"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithms,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/formation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/coefficients,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/genetic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/cell"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming,"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2c537658326d287418ed08e6c1f67f062/brazovayeye"><title>A hybrid image restoration approach: Using fuzzy punctual kriging and genetic programming</title><link>http://www.bibsonomy.org/bibtex/2c537658326d287418ed08e6c1f67f062/brazovayeye</link><dc:creator>brazovayeye</dc:creator><dc:date>2008-06-19T17:35:00+02:00</dc:date><dc:subject>fuzzy similarity adaptive filtering image index programming, punctual restoration, SSIM, logic, structure algorithms, spatial kriging, measure, genetic </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Asmatullah &lt;a href=&#034;http://www.bibsonomy.org/author/Chaudhry&#034;&gt;Chaudhry&lt;/a&gt;  und Asifullah &lt;a href=&#034;http://www.bibsonomy.org/author/Khan&#034;&gt;Khan&lt;/a&gt;  und Asad &lt;a href=&#034;http://www.bibsonomy.org/author/Ali&#034;&gt;Ali&lt;/a&gt;  und Anwar M. &lt;a href=&#034;http://www.bibsonomy.org/author/Mirza&#034;&gt;Mirza&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;International Journal of Imaging Systems and Technology&lt;/em&gt;&lt;em&gt;17(4):224--231&lt;/em&gt;(&lt;em&gt;2007&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/fuzzy"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/adaptive"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/filtering"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/image"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/index"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/punctual"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/restoration,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/SSIM,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/logic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/structure"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithms,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/spatial"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kriging,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/measure,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/genetic"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f5ecf8c5873a25ce74abd39b97db6b70/brazovayeye"><title>Using genetic programming to classify node positive patients in bladder cancer</title><link>http://www.bibsonomy.org/bibtex/2f5ecf8c5873a25ce74abd39b97db6b70/brazovayeye</link><dc:creator>brazovayeye</dc:creator><dc:date>2008-06-19T17:35:00+02:00</dc:date><dc:subject>classifier and measures, bladder algorithms feature Applications, classification learning staging, machine selection, program concept learning, similarity Biological Nodal evaluation, genetic synthesis analysis, pattern design cancer, algorithms, induction, synthesis, programming, rules, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Arpit A. &lt;a href=&#034;http://www.bibsonomy.org/author/Almal&#034;&gt;Almal&lt;/a&gt;  und Anirban P. &lt;a href=&#034;http://www.bibsonomy.org/author/Mitra&#034;&gt;Mitra&lt;/a&gt;  und Ram H. &lt;a href=&#034;http://www.bibsonomy.org/author/Datar&#034;&gt;Datar&lt;/a&gt;  und Peter F. &lt;a href=&#034;http://www.bibsonomy.org/author/Lenehan&#034;&gt;Lenehan&lt;/a&gt;  und David W. &lt;a href=&#034;http://www.bibsonomy.org/author/Fry&#034;&gt;Fry&lt;/a&gt;  und Richard J. &lt;a href=&#034;http://www.bibsonomy.org/author/Cote&#034;&gt;Cote&lt;/a&gt;  und William P. &lt;a href=&#034;http://www.bibsonomy.org/author/Worzel&#034;&gt;Worzel&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;GECCO 2006: Proceedings of the 8th annual conference on Genetic and evolutionary computation, &lt;/em&gt;&lt;em&gt;1, &lt;/em&gt;&lt;em&gt;Seite239--246. &lt;/em&gt;&lt;em&gt;Seattle, Washington, USA, &lt;/em&gt;&lt;em&gt;ACM Press, &lt;/em&gt;&lt;em&gt;8-12 July2006. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/classifier"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/and"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/measures,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bladder"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/feature"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Applications,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/classification"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/staging,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/machine"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/selection,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/concept"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Biological"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Nodal"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evaluation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/genetic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/synthesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analysis,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pattern"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/design"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/cancer,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithms,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/synthesis,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/rules,"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/278fd64c3db55e6387ebdeb6c40054542/michi"><title>Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems</title><description>[0805.2045] Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems</description><link>http://www.bibsonomy.org/bibtex/278fd64c3db55e6387ebdeb6c40054542/michi</link><dc:creator>michi</dc:creator><dc:date>2008-06-18T14:56:53+02:00</dc:date><dc:subject>tagging tag semantic similarity measure master_thesis </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Ciro &lt;a href=&#034;http://www.bibsonomy.org/author/Cattuto&#034;&gt;Cattuto&lt;/a&gt;  und Dominik &lt;a href=&#034;http://www.bibsonomy.org/author/Benz&#034;&gt;Benz&lt;/a&gt;  und Andreas &lt;a href=&#034;http://www.bibsonomy.org/author/Hotho&#034;&gt;Hotho&lt;/a&gt;  und Gerd &lt;a href=&#034;http://www.bibsonomy.org/author/Stumme&#034;&gt;Stumme&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;2008&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tagging"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tag"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/semantic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/measure"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/master_thesis"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/241cf51d129fc591b564ebb30f807cea0/dzibold"><title>A survey of web metrics</title><description>A Survey of Web Metrics - Dhyani, Keong, Bhowmick (ResearchIndex)</description><link>http://www.bibsonomy.org/bibtex/241cf51d129fc591b564ebb30f807cea0/dzibold</link><dc:creator>dzibold</dc:creator><dc:date>2008-06-02T18:51:31+02:00</dc:date><dc:subject>idiom metrics detection similarity </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;D. &lt;a href=&#034;http://www.bibsonomy.org/author/Dhyani&#034;&gt;Dhyani&lt;/a&gt;  und W. &lt;a href=&#034;http://www.bibsonomy.org/author/Keong&#034;&gt;Keong&lt;/a&gt;  und N. &lt;a href=&#034;http://www.bibsonomy.org/author/Bhowmick&#034;&gt;Bhowmick&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/idiom"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/metrics"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/detection"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2773c9b4aea2fb9d479039ae409ac3fa8/mkroell"><title>Learning Semantic Similarity.</title><link>http://www.bibsonomy.org/bibtex/2773c9b4aea2fb9d479039ae409ac3fa8/mkroell</link><dc:creator>mkroell</dc:creator><dc:date>2008-05-31T14:23:21+02:00</dc:date><dc:subject>semantic learning kernel SemanticSimilarity similarity </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Jaz S. &lt;a href=&#034;http://www.bibsonomy.org/author/Kandola&#034;&gt;Kandola&lt;/a&gt;  und John &lt;a href=&#034;http://www.bibsonomy.org/author/Shawe-Taylor&#034;&gt;Shawe-Taylor&lt;/a&gt;  und Nello &lt;a href=&#034;http://www.bibsonomy.org/author/Cristianini&#034;&gt;Cristianini&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Advances in Neural Information Processing Systems 15: Neural, &lt;/em&gt;&lt;em&gt;Seite657-664. &lt;/em&gt;&lt;em&gt;MIT Press, &lt;/em&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/semantic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kernel"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/SemanticSimilarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2275778901efecbb122cb8b9ca8ad9311/mkroell"><title>Shortest-Path Kernels on Graphs</title><description>Shortest-Path Kernels on Graphs</description><link>http://www.bibsonomy.org/bibtex/2275778901efecbb122cb8b9ca8ad9311/mkroell</link><dc:creator>mkroell</dc:creator><dc:date>2008-05-31T14:18:52+02:00</dc:date><dc:subject>shortest kernel path similarity graph </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Karsten M. &lt;a href=&#034;http://www.bibsonomy.org/author/Borgwardt&#034;&gt;Borgwardt&lt;/a&gt;  und Hans-Peter &lt;a href=&#034;http://www.bibsonomy.org/author/Kriegel&#034;&gt;Kriegel&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of the Fifth IEEE International Conference on Data Mining (ICDM 2005), &lt;/em&gt;&lt;em&gt;Seite74--81. &lt;/em&gt;&lt;em&gt;Washington, DC, USA, &lt;/em&gt;&lt;em&gt;IEEE Computer Society, &lt;/em&gt;(&lt;em&gt;2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/shortest"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kernel"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/path"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/22f250404994a287160f00ef1e8a631ac/eswc2008"><title>Conceptual Clustering and its Application to Concept Drift and Novelty Detection</title><link>http://www.bibsonomy.org/bibtex/22f250404994a287160f00ef1e8a631ac/eswc2008</link><dc:creator>eswc2008</dc:creator><dc:date>2008-05-28T14:50:02+02:00</dc:date><dc:subject>setection concept similarity novelty clustering conceptual semantic drift learning </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Nicola &lt;a href=&#034;http://www.bibsonomy.org/author/Fanizzi&#034;&gt;Fanizzi&lt;/a&gt;  und Claudia &lt;a href=&#034;http://www.bibsonomy.org/author/d&amp;#039;Amato&#034;&gt;d&#039;Amato&lt;/a&gt;  und Floriana &lt;a href=&#034;http://www.bibsonomy.org/author/Esposito&#034;&gt;Esposito&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of the 5th European Semantic Web Conference, &lt;/em&gt;&lt;em&gt;Berlin, Heidelberg, &lt;/em&gt;&lt;em&gt;Springer Verlag, &lt;/em&gt;&lt;em&gt;June2008. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/setection"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/concept"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/novelty"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustering"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/conceptual"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/semantic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/drift"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/242b4c94cff05ccef031235d661a7a77a/suhara"><title>Tag-based Social Interest Discovery</title><link>http://www.bibsonomy.org/bibtex/242b4c94cff05ccef031235d661a7a77a/suhara</link><dc:creator>suhara</dc:creator><dc:date>2008-05-26T20:02:00+02:00</dc:date><dc:subject>del.icio.us tagging similarity folksonomy </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Xin &lt;a href=&#034;http://www.bibsonomy.org/author/Li&#034;&gt;Li&lt;/a&gt;  und Lei &lt;a href=&#034;http://www.bibsonomy.org/author/Guo&#034;&gt;Guo&lt;/a&gt;  und Yihong E. &lt;a href=&#034;http://www.bibsonomy.org/author/Zhao&#034;&gt;Zhao&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of the 17th International World Wide Web Conference, &lt;/em&gt;&lt;em&gt;Seite675-684. &lt;/em&gt;&lt;em&gt;ACM, &lt;/em&gt;(&lt;em&gt;2008&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/del.icio.us"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tagging"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/folksonomy"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/25fc2af573c43a5c37d31437ced7b5272/dzibold"><title>Syntactic clustering of the Web</title><description>Syntactic clustering of the Web.
Approach for finding very similar docs on the web.

* Shingling approach
* Computation of digest basing on shingles.
* Computation of super shingles.
* Filtering.
* Clustering in part (division into tiles and merging)

About 30.000.000 docs analyzed.

This approach is used in the paper of Vedran</description><link>http://www.bibsonomy.org/bibtex/25fc2af573c43a5c37d31437ced7b5272/dzibold</link><dc:creator>dzibold</dc:creator><dc:date>2008-05-21T18:32:56+02:00</dc:date><dc:subject>clustering similarity idiom </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Andrei Z. &lt;a href=&#034;http://www.bibsonomy.org/author/Broder&#034;&gt;Broder&lt;/a&gt;  und Steven C. &lt;a href=&#034;http://www.bibsonomy.org/author/Glassman&#034;&gt;Glassman&lt;/a&gt;  und Mark S. &lt;a href=&#034;http://www.bibsonomy.org/author/Manasse&#034;&gt;Manasse&lt;/a&gt;  und Geoffrey &lt;a href=&#034;http://www.bibsonomy.org/author/Zweig&#034;&gt;Zweig&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Comput. Netw. ISDN Syst.&lt;/em&gt;&lt;em&gt;29(8-13):1157--1166&lt;/em&gt;(&lt;em&gt;1997&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustering"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/idiom"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/278fd64c3db55e6387ebdeb6c40054542/steff83"><title>Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems</title><description>[0805.2045] Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems</description><link>http://www.bibsonomy.org/bibtex/278fd64c3db55e6387ebdeb6c40054542/steff83</link><dc:creator>steff83</dc:creator><dc:date>2008-05-20T21:05:46+02:00</dc:date><dc:subject>tag master_thesis tagging semantic similarity measure </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Ciro &lt;a href=&#034;http://www.bibsonomy.org/author/Cattuto&#034;&gt;Cattuto&lt;/a&gt;  und Dominik &lt;a href=&#034;http://www.bibsonomy.org/author/Benz&#034;&gt;Benz&lt;/a&gt;  und Andreas &lt;a href=&#034;http://www.bibsonomy.org/author/Hotho&#034;&gt;Hotho&lt;/a&gt;  und Gerd &lt;a href=&#034;http://www.bibsonomy.org/author/Stumme&#034;&gt;Stumme&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;2008&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tag"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/master_thesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tagging"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/semantic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/measure"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/278fd64c3db55e6387ebdeb6c40054542/suhara"><title>Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems</title><description>[0805.2045] Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems</description><link>http://www.bibsonomy.org/bibtex/278fd64c3db55e6387ebdeb6c40054542/suhara</link><dc:creator>suhara</dc:creator><dc:date>2008-05-20T20:39:46+02:00</dc:date><dc:subject>measure tagging tag semantic similarity </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Ciro &lt;a href=&#034;http://www.bibsonomy.org/author/Cattuto&#034;&gt;Cattuto&lt;/a&gt;  und Dominik &lt;a href=&#034;http://www.bibsonomy.org/author/Benz&#034;&gt;Benz&lt;/a&gt;  und Andreas &lt;a href=&#034;http://www.bibsonomy.org/author/Hotho&#034;&gt;Hotho&lt;/a&gt;  und Gerd &lt;a href=&#034;http://www.bibsonomy.org/author/Stumme&#034;&gt;Stumme&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;2008&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/measure"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tagging"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tag"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/semantic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/26ea5fc946fbc5a95833cc4d3ebfd2247/dzibold"><title>Collection statistics for fast duplicate document detection</title><description>* I-Match algorithm for fast duplicates detection.
* Good overview of existing approaches.
* Big evaluation block testing algorithm with different settings.</description><link>http://www.bibsonomy.org/bibtex/26ea5fc946fbc5a95833cc4d3ebfd2247/dzibold</link><dc:creator>dzibold</dc:creator><dc:date>2008-05-20T20:04:46+02:00</dc:date><dc:subject>idiom hash similarity algorithms keywords </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Abdur &lt;a href=&#034;http://www.bibsonomy.org/author/Chowdhury&#034;&gt;Chowdhury&lt;/a&gt;  und Ophir &lt;a href=&#034;http://www.bibsonomy.org/author/Frieder&#034;&gt;Frieder&lt;/a&gt;  und David &lt;a href=&#034;http://www.bibsonomy.org/author/Grossman&#034;&gt;Grossman&lt;/a&gt;  und Mary Catherine &lt;a href=&#034;http://www.bibsonomy.org/author/McCabe&#034;&gt;McCabe&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;ACM Trans. Inf. Syst.&lt;/em&gt;&lt;em&gt;20(2):171--191&lt;/em&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/idiom"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/hash"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/keywords"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2790a9e4822008cbbddac6d00cc7d032d/dzibold"><title>MatchDetectReveal: finding overlapping and similar digital documents</title><description>MatchDetectReveal
Fast algorithm for plagiatrism detection</description><link>http://www.bibsonomy.org/bibtex/2790a9e4822008cbbddac6d00cc7d032d/dzibold</link><dc:creator>dzibold</dc:creator><dc:date>2008-05-20T19:56:44+02:00</dc:date><dc:subject>chunks idiom algorithms plagiatrism similarity </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Kriszti&#039;an &lt;a href=&#034;http://www.bibsonomy.org/author/Monostori&#034;&gt;Monostori&lt;/a&gt;  und Arkady &lt;a href=&#034;http://www.bibsonomy.org/author/Zaslavsky&#034;&gt;Zaslavsky&lt;/a&gt;  und Heinz &lt;a href=&#034;http://www.bibsonomy.org/author/Schmidt&#034;&gt;Schmidt&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of the 2000 information resources management association international conference on Challenges of information technology management in the 21st century, &lt;/em&gt;&lt;em&gt;Seite955--957. &lt;/em&gt;&lt;em&gt;Hershey, PA, USA, &lt;/em&gt;&lt;em&gt;IGI Publishing, &lt;/em&gt;(&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/chunks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/idiom"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/plagiatrism"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/20f20efb2758d04df582586de416bb0fb/dzibold"><title>Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach</title><description>Mining Sequential Patterns by Pattern-Growth

Effitient algorithm for mining sequential pattern in very large data bases</description><link>http://www.bibsonomy.org/bibtex/20f20efb2758d04df582586de416bb0fb/dzibold</link><dc:creator>dzibold</dc:creator><dc:date>2008-05-20T19:53:47+02:00</dc:date><dc:subject>similarity idiom pattern_mining datamining algorithms </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Behzad &lt;a href=&#034;http://www.bibsonomy.org/author/Mortazavi-Asl&#034;&gt;Mortazavi-Asl&lt;/a&gt;  und Jianyong &lt;a href=&#034;http://www.bibsonomy.org/author/Wang&#034;&gt;Wang&lt;/a&gt;  und Helen &lt;a href=&#034;http://www.bibsonomy.org/author/Pinto&#034;&gt;Pinto&lt;/a&gt;  und Qiming &lt;a href=&#034;http://www.bibsonomy.org/author/Chen&#034;&gt;Chen&lt;/a&gt;  und Mei-Chun &lt;a href=&#034;http://www.bibsonomy.org/author/Hsu&#034;&gt;Hsu&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;IEEE Trans. on Knowl. and Data Eng.&lt;/em&gt;&lt;em&gt;16(11):1424--1440&lt;/em&gt;(&lt;em&gt;2004&lt;/em&gt;) &lt;em&gt;Member-Jian Pei and Senior Member-Jiawei Han and Member-Umeshwar Dayal
		    .
	    &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/idiom"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pattern_mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/datamining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item></rdf:RDF>