I created the Machine Learning Canvas to make it easier to ask the right questions at the beginning of an ML project, and to save people from wasting time and money due to a poor design of their ML system. I’m now releasing the first draft of a book that contains everything there is to know about this framework, in a 1-hour read.
And you can interact with this library with a whole ecosystem of clients :
- A web client : directly on bender's website, you can visualize the optimization process on nice graphs; and compare the performances of different models on the same problem with a ranking board that ultimately allows you to pick the best model with the best hyperparameters set.
- A python one, a R one : it allows you to get automatic suggestions of hyperparameters set to test within your code.
Hi! I wrote that post! Another friend pointed out yesterday this other post about Gaussian Processes: https://www.jgoertler.com/visual-exploration-gaussian-proces... I think that post has some fun visualizations for showing how different kernels work, but I tend to prefer my explanation. Would love to get more eyes on it and feedback specifically about whether I have any mistakes in there!
I was frustrated with how difficult I found making animations in matplotlib so I wrote something to make it easy and called it celluloid. I found the idea in plotnine and simply took out the plotnine specific code and generalized it some more (adding support for subplots).
The goal is that your visualization code shouldn't need to modified at all or as little as possible. With celluloid you take "photos" of your visualization to create each frame. Once all the frames have been captured you can create an animation with one call. The readme has more details.
Spatial co-location pattern mining refers to the task of discovering the group of objects or events that co-occur at many places. Extracting these patterns from spatial data is very difficult due to the complexity of spatial data types, spatial relationships, and spatial auto-correlation. We model the co-location pattern discovery as a clique enumeration problem over a neighborhood graph (which is materialized using a distributed graph database). Further, we propose three new traversal based algorithms, namely CliqueEnumG, CliqueEnumK and CliqueExtend. These algorithms allow for a trade-off between time and memory requirements and support interactive data analysis without having to recompute all the intermediate results.
Trademark registration from Legal Legends helps establish ownership and protect brand of an entity. A trademark is a visual symbol, which may be a word, name, device, label or numerals used by a business to distinguish it goods or services from other similar goods or services originating from a different business. Register your brand and Logo in South Africa with the Online trademark registration service from Legal Legends.
Dedicated Developers is a top-tier Web and Mobile Application Development company. The company was founded in 2007 and employs over 100 employees globally. Their industry leadership stems from their unique model that combines US-based project management and leadership with access to top talent in The UK, Philippines, and Argentina.
Hi there -- one of the authors of the paper here. Optimal stopping problems constitute an important class of stochastic control problems, with many real applications, such as pricing financial options. Typically they are solved using approximate dynamic programming methods, which involve coming up with some approximation of the value function or the continuation value function.
In this paper, we take a different approach, where we represent the stopping policy as a tree, and propose a methodology for learning this tree from the data; so in the same way that one comes up with a tree for predicting a binary label in classification, or predicting a continuous value in regression, one obtains a tree that prescribes an action for each possible state. We show using a standard benchmark problem in option pricing that these tree policies perform very well, while being as simple and interpretable as tree models used in other areas of machine learning. We appreciate any questions or comments!