Reverse dictionary where values are listsConvert dictionary of lists of tuples to list of lists/tuples in pythonMulti-dictionary API using Python Flask-RESTfulUpdating a dict with dict valuesMatching two lists of dicts, strictly and more looselyCreate dictionary with default immutable keysDictionary of dictionary - Get 2nd keysList all possible permutations from a python dictionary of listsFlatten Dictionary Python challengeRemove the second number from every group of three numbersTransforming a dict of lists into a list of dicts

How writing a dominant 7 sus4 chord in RNA ( Vsus7 chord in the 1st inversion)

What mechanic is there to disable a threat instead of killing it?

How can I determine if the org that I'm currently connected to is a scratch org?

Determining Impedance With An Antenna Analyzer

How do I deal with an unproductive colleague in a small company?

One verb to replace 'be a member of' a club

Do scales need to be in alphabetical order?

Avoiding the "not like other girls" trope?

What's the in-universe reasoning behind sorcerers needing material components?

How much of data wrangling is a data scientist's job?

Avoiding direct proof while writing proof by induction

How to tell a function to use the default argument values?

What does the expression "A Mann!" means

Is it acceptable for a professor to tell male students to not think that they are smarter than female students?

Im going to France and my passport expires June 19th

Mathematica command that allows it to read my intentions

Should I tell management that I intend to leave due to bad software development practices?

Could the museum Saturn V's be refitted for one more flight?

How do I gain back my faith in my PhD degree?

What killed these X2 caps?

Why are the 737's rear doors unusable in a water landing?

Forgetting the musical notes while performing in concert

Why is it a bad idea to hire a hitman to eliminate most corrupt politicians?

What do you call someone who asks many questions?



Reverse dictionary where values are lists


Convert dictionary of lists of tuples to list of lists/tuples in pythonMulti-dictionary API using Python Flask-RESTfulUpdating a dict with dict valuesMatching two lists of dicts, strictly and more looselyCreate dictionary with default immutable keysDictionary of dictionary - Get 2nd keysList all possible permutations from a python dictionary of listsFlatten Dictionary Python challengeRemove the second number from every group of three numbersTransforming a dict of lists into a list of dicts













3












$begingroup$


I'm working on the following problem: I've got a dictionary like this one:



dic=0:[0,1,2],1:[3,4,5]


And I want to reverse it so it looks like this:



dic2=0:0,1:0,2:0,3:1,4:1,5:1


I managed to make it, but doing this:



dic2=
for i in dic:
for j in dic[i]:
dic2[j]=i


I know about list and dict comprehensions and this code reeks of it, but I'm not good at them when there are nested for and dicts. How would you make it more efficiently?










share|improve this question









New contributor




Juan C is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$
















    3












    $begingroup$


    I'm working on the following problem: I've got a dictionary like this one:



    dic=0:[0,1,2],1:[3,4,5]


    And I want to reverse it so it looks like this:



    dic2=0:0,1:0,2:0,3:1,4:1,5:1


    I managed to make it, but doing this:



    dic2=
    for i in dic:
    for j in dic[i]:
    dic2[j]=i


    I know about list and dict comprehensions and this code reeks of it, but I'm not good at them when there are nested for and dicts. How would you make it more efficiently?










    share|improve this question









    New contributor




    Juan C is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.







    $endgroup$














      3












      3








      3





      $begingroup$


      I'm working on the following problem: I've got a dictionary like this one:



      dic=0:[0,1,2],1:[3,4,5]


      And I want to reverse it so it looks like this:



      dic2=0:0,1:0,2:0,3:1,4:1,5:1


      I managed to make it, but doing this:



      dic2=
      for i in dic:
      for j in dic[i]:
      dic2[j]=i


      I know about list and dict comprehensions and this code reeks of it, but I'm not good at them when there are nested for and dicts. How would you make it more efficiently?










      share|improve this question









      New contributor




      Juan C is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.







      $endgroup$




      I'm working on the following problem: I've got a dictionary like this one:



      dic=0:[0,1,2],1:[3,4,5]


      And I want to reverse it so it looks like this:



      dic2=0:0,1:0,2:0,3:1,4:1,5:1


      I managed to make it, but doing this:



      dic2=
      for i in dic:
      for j in dic[i]:
      dic2[j]=i


      I know about list and dict comprehensions and this code reeks of it, but I'm not good at them when there are nested for and dicts. How would you make it more efficiently?







      python dictionary






      share|improve this question









      New contributor




      Juan C is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|improve this question









      New contributor




      Juan C is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|improve this question




      share|improve this question








      edited 5 hours ago









      Sᴀᴍ Onᴇᴌᴀ

      10.1k62167




      10.1k62167






      New contributor




      Juan C is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 6 hours ago









      Juan CJuan C

      1235




      1235




      New contributor




      Juan C is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      Juan C is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      Juan C is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.




















          1 Answer
          1






          active

          oldest

          votes


















          4












          $begingroup$

          There's really not much to say about this code, it is straightforward.



          Style



          These are only nitpicks.



          • Generic dictionary keys are typically named k instead of i or j, but in a specific application a more descriptive name would be even better.

          • Collections should be named by their purpose in the application, not their type.

          • By convention, assignments and other binary operators should be surrounded by spaces: a = b, not a=b. See PEP 8 for reference, if you're not already aware of it. Following this style guide makes your code easier to read for others.

          Code improvements



          When iterating over the keys and values of a dictionary at the same time, you can use



          for k, v in dic.items():
          # ... use k, v ...


          instead of



          for k in dic:
          v = dic[k]
          # ...


          The nested loop can be transformed to a dictionary comprehension like this:



          dic2 = v: k for k, values in dic.items() for v in values


          You can remember that the order of for clauses in the comprehension is the same as the order of corresponding nested for loops.



          Potential pitfalls



          You should be aware that this transformation from a dictionary of lists to a reverse dictionary only works if all items in the original lists are unique. Counterexample:



          >>> dic = 0: [1, 2], 1: [2, 3]
          >>> v: k for k, values in dic.items() for v in values
          1: 0, 2: 1, 3: 1 # missing 2: 0


          To correct this, the output dictionary should have the same format as the input, namely mapping each of the items in the input lists to a list of corresponding keys.



          If the input represents a directed graph (mapping nodes to lists of neighbours), this corresponds to computing the transposed or reversed graph. It can be done by using a collections.defaultdict. I don't see an easy way to write it as a comprehension in this case.



          from collections import defaultdict

          graph = 0: [1, 2], 1: [2, 3]

          transposed_graph = defaultdict(list)
          for node, neighbours in graph.items():
          for neighbour in neighbours:
          transposed_graph[neighbour].append(node)

          # 1: [0], 2: [0, 1], 3: [1]





          share|improve this answer









          $endgroup$













            Your Answer





            StackExchange.ifUsing("editor", function ()
            return StackExchange.using("mathjaxEditing", function ()
            StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
            StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
            );
            );
            , "mathjax-editing");

            StackExchange.ifUsing("editor", function ()
            StackExchange.using("externalEditor", function ()
            StackExchange.using("snippets", function ()
            StackExchange.snippets.init();
            );
            );
            , "code-snippets");

            StackExchange.ready(function()
            var channelOptions =
            tags: "".split(" "),
            id: "196"
            ;
            initTagRenderer("".split(" "), "".split(" "), channelOptions);

            StackExchange.using("externalEditor", function()
            // Have to fire editor after snippets, if snippets enabled
            if (StackExchange.settings.snippets.snippetsEnabled)
            StackExchange.using("snippets", function()
            createEditor();
            );

            else
            createEditor();

            );

            function createEditor()
            StackExchange.prepareEditor(
            heartbeatType: 'answer',
            autoActivateHeartbeat: false,
            convertImagesToLinks: false,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: null,
            bindNavPrevention: true,
            postfix: "",
            imageUploader:
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            ,
            onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            );



            );






            Juan C is a new contributor. Be nice, and check out our Code of Conduct.









            draft saved

            draft discarded


















            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216814%2freverse-dictionary-where-values-are-lists%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            4












            $begingroup$

            There's really not much to say about this code, it is straightforward.



            Style



            These are only nitpicks.



            • Generic dictionary keys are typically named k instead of i or j, but in a specific application a more descriptive name would be even better.

            • Collections should be named by their purpose in the application, not their type.

            • By convention, assignments and other binary operators should be surrounded by spaces: a = b, not a=b. See PEP 8 for reference, if you're not already aware of it. Following this style guide makes your code easier to read for others.

            Code improvements



            When iterating over the keys and values of a dictionary at the same time, you can use



            for k, v in dic.items():
            # ... use k, v ...


            instead of



            for k in dic:
            v = dic[k]
            # ...


            The nested loop can be transformed to a dictionary comprehension like this:



            dic2 = v: k for k, values in dic.items() for v in values


            You can remember that the order of for clauses in the comprehension is the same as the order of corresponding nested for loops.



            Potential pitfalls



            You should be aware that this transformation from a dictionary of lists to a reverse dictionary only works if all items in the original lists are unique. Counterexample:



            >>> dic = 0: [1, 2], 1: [2, 3]
            >>> v: k for k, values in dic.items() for v in values
            1: 0, 2: 1, 3: 1 # missing 2: 0


            To correct this, the output dictionary should have the same format as the input, namely mapping each of the items in the input lists to a list of corresponding keys.



            If the input represents a directed graph (mapping nodes to lists of neighbours), this corresponds to computing the transposed or reversed graph. It can be done by using a collections.defaultdict. I don't see an easy way to write it as a comprehension in this case.



            from collections import defaultdict

            graph = 0: [1, 2], 1: [2, 3]

            transposed_graph = defaultdict(list)
            for node, neighbours in graph.items():
            for neighbour in neighbours:
            transposed_graph[neighbour].append(node)

            # 1: [0], 2: [0, 1], 3: [1]





            share|improve this answer









            $endgroup$

















              4












              $begingroup$

              There's really not much to say about this code, it is straightforward.



              Style



              These are only nitpicks.



              • Generic dictionary keys are typically named k instead of i or j, but in a specific application a more descriptive name would be even better.

              • Collections should be named by their purpose in the application, not their type.

              • By convention, assignments and other binary operators should be surrounded by spaces: a = b, not a=b. See PEP 8 for reference, if you're not already aware of it. Following this style guide makes your code easier to read for others.

              Code improvements



              When iterating over the keys and values of a dictionary at the same time, you can use



              for k, v in dic.items():
              # ... use k, v ...


              instead of



              for k in dic:
              v = dic[k]
              # ...


              The nested loop can be transformed to a dictionary comprehension like this:



              dic2 = v: k for k, values in dic.items() for v in values


              You can remember that the order of for clauses in the comprehension is the same as the order of corresponding nested for loops.



              Potential pitfalls



              You should be aware that this transformation from a dictionary of lists to a reverse dictionary only works if all items in the original lists are unique. Counterexample:



              >>> dic = 0: [1, 2], 1: [2, 3]
              >>> v: k for k, values in dic.items() for v in values
              1: 0, 2: 1, 3: 1 # missing 2: 0


              To correct this, the output dictionary should have the same format as the input, namely mapping each of the items in the input lists to a list of corresponding keys.



              If the input represents a directed graph (mapping nodes to lists of neighbours), this corresponds to computing the transposed or reversed graph. It can be done by using a collections.defaultdict. I don't see an easy way to write it as a comprehension in this case.



              from collections import defaultdict

              graph = 0: [1, 2], 1: [2, 3]

              transposed_graph = defaultdict(list)
              for node, neighbours in graph.items():
              for neighbour in neighbours:
              transposed_graph[neighbour].append(node)

              # 1: [0], 2: [0, 1], 3: [1]





              share|improve this answer









              $endgroup$















                4












                4








                4





                $begingroup$

                There's really not much to say about this code, it is straightforward.



                Style



                These are only nitpicks.



                • Generic dictionary keys are typically named k instead of i or j, but in a specific application a more descriptive name would be even better.

                • Collections should be named by their purpose in the application, not their type.

                • By convention, assignments and other binary operators should be surrounded by spaces: a = b, not a=b. See PEP 8 for reference, if you're not already aware of it. Following this style guide makes your code easier to read for others.

                Code improvements



                When iterating over the keys and values of a dictionary at the same time, you can use



                for k, v in dic.items():
                # ... use k, v ...


                instead of



                for k in dic:
                v = dic[k]
                # ...


                The nested loop can be transformed to a dictionary comprehension like this:



                dic2 = v: k for k, values in dic.items() for v in values


                You can remember that the order of for clauses in the comprehension is the same as the order of corresponding nested for loops.



                Potential pitfalls



                You should be aware that this transformation from a dictionary of lists to a reverse dictionary only works if all items in the original lists are unique. Counterexample:



                >>> dic = 0: [1, 2], 1: [2, 3]
                >>> v: k for k, values in dic.items() for v in values
                1: 0, 2: 1, 3: 1 # missing 2: 0


                To correct this, the output dictionary should have the same format as the input, namely mapping each of the items in the input lists to a list of corresponding keys.



                If the input represents a directed graph (mapping nodes to lists of neighbours), this corresponds to computing the transposed or reversed graph. It can be done by using a collections.defaultdict. I don't see an easy way to write it as a comprehension in this case.



                from collections import defaultdict

                graph = 0: [1, 2], 1: [2, 3]

                transposed_graph = defaultdict(list)
                for node, neighbours in graph.items():
                for neighbour in neighbours:
                transposed_graph[neighbour].append(node)

                # 1: [0], 2: [0, 1], 3: [1]





                share|improve this answer









                $endgroup$



                There's really not much to say about this code, it is straightforward.



                Style



                These are only nitpicks.



                • Generic dictionary keys are typically named k instead of i or j, but in a specific application a more descriptive name would be even better.

                • Collections should be named by their purpose in the application, not their type.

                • By convention, assignments and other binary operators should be surrounded by spaces: a = b, not a=b. See PEP 8 for reference, if you're not already aware of it. Following this style guide makes your code easier to read for others.

                Code improvements



                When iterating over the keys and values of a dictionary at the same time, you can use



                for k, v in dic.items():
                # ... use k, v ...


                instead of



                for k in dic:
                v = dic[k]
                # ...


                The nested loop can be transformed to a dictionary comprehension like this:



                dic2 = v: k for k, values in dic.items() for v in values


                You can remember that the order of for clauses in the comprehension is the same as the order of corresponding nested for loops.



                Potential pitfalls



                You should be aware that this transformation from a dictionary of lists to a reverse dictionary only works if all items in the original lists are unique. Counterexample:



                >>> dic = 0: [1, 2], 1: [2, 3]
                >>> v: k for k, values in dic.items() for v in values
                1: 0, 2: 1, 3: 1 # missing 2: 0


                To correct this, the output dictionary should have the same format as the input, namely mapping each of the items in the input lists to a list of corresponding keys.



                If the input represents a directed graph (mapping nodes to lists of neighbours), this corresponds to computing the transposed or reversed graph. It can be done by using a collections.defaultdict. I don't see an easy way to write it as a comprehension in this case.



                from collections import defaultdict

                graph = 0: [1, 2], 1: [2, 3]

                transposed_graph = defaultdict(list)
                for node, neighbours in graph.items():
                for neighbour in neighbours:
                transposed_graph[neighbour].append(node)

                # 1: [0], 2: [0, 1], 3: [1]






                share|improve this answer












                share|improve this answer



                share|improve this answer










                answered 5 hours ago









                mkrieger1mkrieger1

                1,4231824




                1,4231824




















                    Juan C is a new contributor. Be nice, and check out our Code of Conduct.









                    draft saved

                    draft discarded


















                    Juan C is a new contributor. Be nice, and check out our Code of Conduct.












                    Juan C is a new contributor. Be nice, and check out our Code of Conduct.











                    Juan C is a new contributor. Be nice, and check out our Code of Conduct.














                    Thanks for contributing an answer to Code Review Stack Exchange!


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid


                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.

                    Use MathJax to format equations. MathJax reference.


                    To learn more, see our tips on writing great answers.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function ()
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216814%2freverse-dictionary-where-values-are-lists%23new-answer', 'question_page');

                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    Popular posts from this blog

                    Францішак Багушэвіч Змест Сям'я | Біяграфія | Творчасць | Мова Багушэвіча | Ацэнкі дзейнасці | Цікавыя факты | Спадчына | Выбраная бібліяграфія | Ушанаванне памяці | У філатэліі | Зноскі | Літаратура | Спасылкі | НавігацыяЛяхоўскі У. Рупіўся дзеля Бога і людзей: Жыццёвы шлях Лявона Вітан-Дубейкаўскага // Вольскі і Памідораў з песняй пра немца Адвакат, паэт, народны заступнік Ашмянскі веснікВ Минске появится площадь Богушевича и улица Сырокомли, Белорусская деловая газета, 19 июля 2001 г.Айцец беларускай нацыянальнай ідэі паўстаў у бронзе Сяргей Аляксандравіч Адашкевіч (1918, Мінск). 80-я гады. Бюст «Францішак Багушэвіч».Яўген Мікалаевіч Ціхановіч. «Партрэт Францішка Багушэвіча»Мікола Мікалаевіч Купава. «Партрэт зачынальніка новай беларускай літаратуры Францішка Багушэвіча»Уладзімір Іванавіч Мелехаў. На помніку «Змагарам за родную мову» Барэльеф «Францішак Багушэвіч»Памяць пра Багушэвіча на Віленшчыне Страчаная сталіца. Беларускія шыльды на вуліцах Вільні«Krynica». Ideologia i przywódcy białoruskiego katolicyzmuФранцішак БагушэвічТворы на knihi.comТворы Францішка Багушэвіча на bellib.byСодаль Уладзімір. Францішак Багушэвіч на Лідчыне;Луцкевіч Антон. Жыцьцё і творчасьць Фр. Багушэвіча ў успамінах ягоных сучасьнікаў // Запісы Беларускага Навуковага таварыства. Вільня, 1938. Сшытак 1. С. 16-34.Большая российская1188761710000 0000 5537 633Xn9209310021619551927869394п

                    Беларусь Змест Назва Гісторыя Геаграфія Сімволіка Дзяржаўны лад Палітычныя партыі Міжнароднае становішча і знешняя палітыка Адміністрацыйны падзел Насельніцтва Эканоміка Культура і грамадства Сацыяльная сфера Узброеныя сілы Заўвагі Літаратура Спасылкі НавігацыяHGЯOiТоп-2011 г. (па версіі ej.by)Топ-2013 г. (па версіі ej.by)Топ-2016 г. (па версіі ej.by)Топ-2017 г. (па версіі ej.by)Нацыянальны статыстычны камітэт Рэспублікі БеларусьШчыльнасць насельніцтва па краінахhttp://naviny.by/rubrics/society/2011/09/16/ic_articles_116_175144/А. Калечыц, У. Ксяндзоў. Спробы засялення краю неандэртальскім чалавекам.І ў Менску былі мамантыА. Калечыц, У. Ксяндзоў. Старажытны каменны век (палеаліт). Першапачатковае засяленне тэрыторыіГ. Штыхаў. Балты і славяне ў VI—VIII стст.М. Клімаў. Полацкае княства ў IX—XI стст.Г. Штыхаў, В. Ляўко. Палітычная гісторыя Полацкай зямліГ. Штыхаў. Дзяржаўны лад у землях-княствахГ. Штыхаў. Дзяржаўны лад у землях-княствахБеларускія землі ў складзе Вялікага Княства ЛітоўскагаЛюблінская унія 1569 г."The Early Stages of Independence"Zapomniane prawdy25 гадоў таму было аб'яўлена, што Язэп Пілсудскі — беларус (фота)Наша вадаДакументы ЧАЭС: Забруджванне тэрыторыі Беларусі « ЧАЭС Зона адчужэнняСведения о политических партиях, зарегистрированных в Республике Беларусь // Министерство юстиции Республики БеларусьСтатыстычны бюлетэнь „Полаўзроставая структура насельніцтва Рэспублікі Беларусь на 1 студзеня 2012 года і сярэднегадовая колькасць насельніцтва за 2011 год“Индекс человеческого развития Беларуси — не было бы нижеБеларусь занимает первое место в СНГ по индексу развития с учетом гендерного факцёраНацыянальны статыстычны камітэт Рэспублікі БеларусьКанстытуцыя РБ. Артыкул 17Трансфармацыйныя задачы БеларусіВыйсце з крызісу — далейшае рэфармаванне Беларускі рубель — сусветны лідар па дэвальвацыяхПра змену коштаў у кастрычніку 2011 г.Бядней за беларусаў у СНД толькі таджыкіСярэдні заробак у верасні дасягнуў 2,26 мільёна рублёўЭканомікаГаласуем за ТОП-100 беларускай прозыСучасныя беларускія мастакіАрхитектура Беларуси BELARUS.BYА. Каханоўскі. Культура Беларусі ўсярэдзіне XVII—XVIII ст.Анталогія беларускай народнай песні, гуказапісы спеваўБеларускія Музычныя IнструментыБеларускі рок, які мы страцілі. Топ-10 гуртоў«Мясцовы час» — нязгаслая легенда беларускай рок-музыкіСЯРГЕЙ БУДКІН. МЫ НЯ ЗНАЕМ СВАЁЙ МУЗЫКІМ. А. Каладзінскі. НАРОДНЫ ТЭАТРМагнацкія культурныя цэнтрыПублічная дыскусія «Беларуская новая пьеса: без беларускай мовы ці беларуская?»Беларускія драматургі па-ранейшаму лепш ставяцца за мяжой, чым на радзіме«Працэс незалежнага кіно пайшоў, і дзяржаву турбуе яго непадкантрольнасць»Беларускія філосафы ў пошуках прасторыВсе идём в библиотекуАрхіваванаАб Нацыянальнай праграме даследавання і выкарыстання касмічнай прасторы ў мірных мэтах на 2008—2012 гадыУ космас — разам.У суседнім з Барысаўскім раёне пабудуюць Камандна-вымяральны пунктСвяты і абрады беларусаў«Мірныя бульбашы з малой краіны» — 5 непраўдзівых стэрэатыпаў пра БеларусьМ. Раманюк. Беларускае народнае адзеннеУ Беларусі скарачаецца колькасць злачынстваўЛукашэнка незадаволены мінскімі ўладамі Крадзяжы складаюць у Мінску каля 70% злачынстваў Узровень злачыннасці ў Мінскай вобласці — адзін з самых высокіх у краіне Генпракуратура аналізуе стан са злачыннасцю ў Беларусі па каэфіцыенце злачыннасці У Беларусі стабілізавалася крымінагеннае становішча, лічыць генпракурорЗамежнікі сталі здзяйсняць у Беларусі больш злачынстваўМУС Беларусі турбуе рост рэцыдыўнай злачыннасціЯ з ЖЭСа. Дазволіце вас абкрасці! Рэйтынг усіх службаў і падраздзяленняў ГУУС Мінгарвыканкама вырасАб КДБ РБГісторыя Аператыўна-аналітычнага цэнтра РБГісторыя ДКФРТаможняagentura.ruБеларусьBelarus.by — Афіцыйны сайт Рэспублікі БеларусьСайт урада БеларусіRadzima.org — Збор архітэктурных помнікаў, гісторыя Беларусі«Глобус Беларуси»Гербы и флаги БеларусиАсаблівасці каменнага веку на БеларусіА. Калечыц, У. Ксяндзоў. Старажытны каменны век (палеаліт). Першапачатковае засяленне тэрыторыіУ. Ксяндзоў. Сярэдні каменны век (мезаліт). Засяленне краю плямёнамі паляўнічых, рыбакоў і збіральнікаўА. Калечыц, М. Чарняўскі. Плямёны на тэрыторыі Беларусі ў новым каменным веку (неаліце)А. Калечыц, У. Ксяндзоў, М. Чарняўскі. Гаспадарчыя заняткі ў каменным векуЭ. Зайкоўскі. Духоўная культура ў каменным векуАсаблівасці бронзавага веку на БеларусіФарміраванне супольнасцей ранняга перыяду бронзавага векуФотографии БеларусиРоля беларускіх зямель ва ўтварэнні і ўмацаванні ВКЛВ. Фадзеева. З гісторыі развіцця беларускай народнай вышыўкіDMOZGran catalanaБольшая российскаяBritannica (анлайн)Швейцарскі гістарычны15325917611952699xDA123282154079143-90000 0001 2171 2080n9112870100577502ge128882171858027501086026362074122714179пппппп

                    ValueError: Expected n_neighbors <= n_samples, but n_samples = 1, n_neighbors = 6 (SMOTE) The 2019 Stack Overflow Developer Survey Results Are InCan SMOTE be applied over sequence of words (sentences)?ValueError when doing validation with random forestsSMOTE and multi class oversamplingLogic behind SMOTE-NC?ValueError: Error when checking target: expected dense_1 to have shape (7,) but got array with shape (1,)SmoteBoost: Should SMOTE be ran individually for each iteration/tree in the boosting?solving multi-class imbalance classification using smote and OSSUsing SMOTE for Synthetic Data generation to improve performance on unbalanced dataproblem of entry format for a simple model in KerasSVM SMOTE fit_resample() function runs forever with no result