Compare columns of pandas dataframes and fill missing values -


i have 2 pandas dataframes follows.

list1 = [{'salt': 0.2, 'fat': 0.8}, {'fat': 1.0, 'protein': 0.9}] df1 = pd.dataframe(line2) # fill missing values zeros df1.fillna(0, inplace=true)  list2 = [{'salt': 0.1, 'sugar': 0.9}, {'oil': 0.9, 'sugar': 0.8, 'salt': 0.2}, {'protein': 0.9}] df2 = pd.dataframe(line2) # fill missing values zeros df2.fillna(0, inplace=true)

my 2 data frames follows.

df1:    fat  protein  salt 0  0.8      0.0   0.2 1  1.0      0.9   0.0  df2:    oil  protein  salt  sugar 0  0.0      0.0   0.1    0.9 1  0.9      0.0   0.2    0.8 2  0.0      0.9   0.0    0.0

now want compare df1 , df2 find missing topics , fill them zero, final version of dataframes looks follows.

df1:    fat  protein  salt  oil  sugar 0  0.8      0.0   0.2   0    0 1  1.0      0.9   0.0   0    0  df2:    oil  protein  salt  sugar  fat 0  0.0      0.0   0.1    0.9   0 1  0.9      0.0   0.2    0.8   0 2  0.0      0.9   0.0    0.0   0

i know within dataframe using df1.fillna(0, inplace=true). 2 dataframes, how can it?

use pd.dataframe.align making sure align along column axis. use argument fill_value=0 fill in missing elements zero.

df1, df2 = df1.align(df2, axis=1, fill_value=0) 
df1     fat  oil  protein  salt  sugar 0  0.8    0      0.0   0.2      0 1  1.0    0      0.9   0.0      0 
df2     fat  oil  protein  salt  sugar 0    0  0.0      0.0   0.1    0.9 1    0  0.9      0.0   0.2    0.8 2    0  0.0      0.9   0.0    0.0

Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more