Congrats and thanks to Andreas and everyone involved in the release,
the website fixes and the online survey setup.
I posted Andreas blog post on HN and reddit:
- http://news.ycombinator.com/item?id=5094319
-
http://www.reddit.com/r/programming/comments/170oty/scikitlearn_013_is_out_machine_lear
Hi all.
I am very happy to announce the release of scikit-learn 0.13.
New features in this release include feature hashing for text processing,
passive-agressive classifiers, faster random forests and many more.
There have also been countless improvements in stability, consistency and
usability.
Hi,
On Sun, Jan 20, 2013 at 6:10 PM, Olivier Delalleau wrote:
> 2013/1/18 Matthew Brett :
>> Hi,
>>
>> On Fri, Jan 18, 2013 at 7:58 PM, Chris Barker - NOAA Federal
>> wrote:
>>> On Fri, Jan 18, 2013 at 4:39 AM, Olivier Delalleau wrote:
Le vendredi 18 janvier 2013, Chris Barker - NOAA Feder
On Mon, 2013-01-21 at 08:41 -0500, Neal Becker wrote:
> I have an array to be used for indexing. It is 2d, where the rows are
> all the
> permutations of some numbers. So:
>
> array([[-2, -2, -2],
>[-2, -2, -1],
>[-2, -2, 0],
>[-2, -2, 1],
>[-2, -2, 2],
> ...
On Mon, Jan 21, 2013 at 2:41 PM, Neal Becker wrote:
> I have an array to be used for indexing. It is 2d, where the rows are all the
> permutations of some numbers. So:
>
> array([[-2, -2, -2],
>[-2, -2, -1],
>[-2, -2, 0],
>[-2, -2, 1],
>[-2, -2, 2],
> ...
>
I have an array to be used for indexing. It is 2d, where the rows are all the
permutations of some numbers. So:
array([[-2, -2, -2],
[-2, -2, -1],
[-2, -2, 0],
[-2, -2, 1],
[-2, -2, 2],
...
[ 2, 1, 2],
[ 2, 2, -2],
[ 2, 2, -1],
[ 2
Le 18/01/2013 23:22, Matthew Brett a écrit :
> I personally find 'fill' OK. I'd read:
>
> a = np.empty((10, 10), fill=np.nan)
>
> as
>
> "make an empty array shape (10, 10) and fill with nans"
+1
(and now we have *two* verbs ! )
--
Pierre
signature.asc
Description: OpenPGP digital signature
