乐胖代购免代理版

{"id":"https://openalex.org/W2117998528","doi":"https://doi.org/10.1109/ijcnn.2011.6033270","title":"Expectation-maximization approach to Boolean factor analysis","display_name":"Expectation-maximization approach to Boolean factor analysis","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2117998528","doi":"https://doi.org/10.1109/ijcnn.2011.6033270","mag":"2117998528"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2011.6033270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089027020","display_name":"Alexander Frolov","orcid":"https://orcid.org/0000-0002-6429-6299"},"institutions":[{"id":"https://openalex.org/I1313323035","display_name":"Russian Academy of Sciences","ror":"https://ror.org/05qrfxd25","country_code":"RU","type":"government","lineage":["https://openalex.org/I1313323035"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Alexander A. Frolov","raw_affiliation_strings":["Institute of Higher Nervous Activity & Neurophysiology, Russian Academy of Sciences, Russia."],"affiliations":[{"raw_affiliation_string":"Institute of Higher Nervous Activity & Neurophysiology, Russian Academy of Sciences, Russia.","institution_ids":["https://openalex.org/I1313323035"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002094747","display_name":"Du\u0161an H\u00fasek","orcid":"https://orcid.org/0000-0002-4011-5465"},"institutions":[{"id":"https://openalex.org/I4210155092","display_name":"Czech Academy of Sciences, Institute of Computer Science","ror":"https://ror.org/0496n6574","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210155092"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Dusan Husek","raw_affiliation_strings":["Institute of Computer Science, Academy of Sciences of the Czech Republic, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Academy of Sciences of the Czech Republic, Czech Republic","institution_ids":["https://openalex.org/I4210155092"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071606604","display_name":"Pavel Polyakov","orcid":"https://orcid.org/0000-0003-0927-7869"},"institutions":[{"id":"https://openalex.org/I1313323035","display_name":"Russian Academy of Sciences","ror":"https://ror.org/05qrfxd25","country_code":"RU","type":"government","lineage":["https://openalex.org/I1313323035"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Pavel Yu. Polyakov","raw_affiliation_strings":["Scientific-Research Institute for System Studies, Russian Academy of Sciences, Russia"],"affiliations":[{"raw_affiliation_string":"Scientific-Research Institute for System Studies, Russian Academy of Sciences, Russia","institution_ids":["https://openalex.org/I1313323035"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.588,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":2,"citation_normalized_percentile":{"value":0.616345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":72,"max":76},"biblio":{"volume":"5","issue":null,"first_page":"559","last_page":"566"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12254","display_name":"Machine Learning in Bioinformatics","score":0.9973,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12254","display_name":"Machine Learning in Bioinformatics","score":0.9973,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.9968,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.9913,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.64414376},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.616969},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.55332357},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.44361362}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7101443},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6689738},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.64414376},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.616969},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.60290664},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.55332357},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.5118886},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5077742},{"id":"https://openalex.org/C182081679","wikidata":"https://www.wikidata.org/wiki/Q1275153","display_name":"Expectation\u2013maximization algorithm","level":3,"score":0.5027337},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.47313634},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.44361362},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39523128},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.39357325},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.38435102},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29821306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1969215},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19290167},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.19113961},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07909006},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.077070534},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2011.6033270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":21,"referenced_works":["https://openalex.org/W1965567101","https://openalex.org/W2018045523","https://openalex.org/W2026235741","https://openalex.org/W2048205984","https://openalex.org/W2049633694","https://openalex.org/W2057885377","https://openalex.org/W2106884367","https://openalex.org/W2107060668","https://openalex.org/W2113654464","https://openalex.org/W2117824861","https://openalex.org/W2118718620","https://openalex.org/W2130055919","https://openalex.org/W2140000393","https://openalex.org/W2145211411","https://openalex.org/W2149569795","https://openalex.org/W2156021959","https://openalex.org/W2161164955","https://openalex.org/W2567948266","https://openalex.org/W3164301339","https://openalex.org/W4252706339","https://openalex.org/W81167575"],"related_works":["https://openalex.org/W4243221174","https://openalex.org/W3212751295","https://openalex.org/W2995617542","https://openalex.org/W2131164334","https://openalex.org/W1996276855","https://openalex.org/W1926436803","https://openalex.org/W1745650241","https://openalex.org/W1568384982","https://openalex.org/W1501085929","https://openalex.org/W1496352327"],"abstract_inverted_index":{"Methods":[0],"for":[1,50],"hidden":[2],"structure":[3],"of":[4,11,47,65,79,96],"high-dimensional":[5],"binary":[6,48],"data":[7,49],"discovery":[8],"are":[9,22],"one":[10],"the":[12,37,71],"most":[13,43],"important":[14],"challenges":[15],"facing":[16],"machine":[17],"learning":[18],"community":[19],"researchers.":[20],"There":[21],"many":[23],"approaches":[24,98],"in":[25],"literature":[26],"that":[27],"try":[28],"to":[29],"solve":[30],"this":[31],"hitherto":[32],"rather":[33],"ill-defined":[34],"task.":[35],"In":[36],"present":[38],"study,":[39],"we":[40,76,91],"propose":[41],"a":[42],"general":[44],"generative":[45],"model":[46],"Boolean":[51,58,66,81],"factor":[52],"analysis":[53],"and":[54,94,103],"introduce":[55],"new":[56],"Expectation-Maximization":[57,80],"Factor":[59,67,82],"Analysis":[60,68,83],"algorithm":[61,84],"which":[62],"maximizes":[63],"likelihood":[64],"solution.":[69],"Using":[70],"so-called":[72],"bars":[73],"problem":[74],"benchmark,":[75],"compare":[77],"efficiencies":[78],"with":[85],"Dendritic":[86],"Inhibition":[87],"neural":[88],"network.":[89],"Then":[90],"discuss":[92],"advantages":[93],"disadvantages":[95],"both":[97],"as":[99],"regards":[100],"results":[101],"quality":[102],"methods":[104],"efficiency.":[105]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2117998528","counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-01-19T03:08:26.489430","created_date":"2016-06-24"}