Welcome, Guest: Register On Nairaland / LOGIN! / Trending / Recent / NewStats: 3,148,926 members, 7,803,008 topics. Date: Saturday, 20 April 2024 at 07:17 AM |
Nairaland Forum / Ibbaba's Profile / Ibbaba's Posts
(1) (2) (3) (4) (5) (6) (7) (8) (9) (10) (of 11 pages)
Technology Market / Re: Samsung S21 Ultra Available by Ibbaba(m): 12:29pm On Aug 09, 2022 |
Still available |
Technology Market / Re: Save Box by Ibbaba(m): 12:29pm On Aug 09, 2022 |
Still available for sale |
Technology Market / Re: Save Box by Ibbaba(m): 4:31pm On Aug 08, 2022 |
Available 08032163323
|
Technology Market / Save Box by Ibbaba(m): 4:29pm On Aug 08, 2022 |
Save box for sale. Asking price 100k call or what's app 08032163323 |
Technology Market / Re: Samsung S21 Ultra Available by Ibbaba(m): 4:26pm On Aug 08, 2022 |
Still available call or what's app 08032163323 |
Technology Market / Samsung S21 Ultra Available by Ibbaba(m): 3:29pm On Aug 06, 2022 |
Used one available. C'EAN AND WORKING PERFECTLY FINE 5G NETWORK 12G RAM 256 MEMORY AVAILABLE FOR SALE AT 420,000
|
Phones / Re: Sa.... by Ibbaba(m): 7:38pm On Jun 26, 2022 |
Sold |
Phones / Re: Sa.... by Ibbaba(m): 4:21pm On Mar 07, 2022 |
Still available. Chat me here if you want it 08027411140 |
Phones / Re: Sa.... by Ibbaba(m): 1:00pm On Feb 27, 2022 |
Still available |
Phones / Re: Sa.... by Ibbaba(m): 1:00pm On Feb 27, 2022 |
Hello, if you are interested I can be reach here 08032163323 what's app |
Phones / Re: Sa.... by Ibbaba(m): 6:46am On Feb 26, 2022 |
Available |
Phones / Sa.... by Ibbaba(m): 7:19pm On Feb 25, 2022 |
.... |
Phones / Re: . by Ibbaba(m): 7:16pm On Feb 25, 2022 |
I've got one to sale. If you are interested chat me |
Education / Re: Unilag 2017 Thread by Ibbaba(m): 8:48pm On Sep 05, 2017 |
Hello house Please any one here applying for operation research ? Need the pq to practice and contacts to be more informed. Please hala |
Education / Re: Unilag 2017 Thread by Ibbaba(m): 3:29pm On Aug 15, 2017 |
Hi guys anyone with Operation Research masters past question please here. i will appreciate it if you drop it here ibbaba234@gmail.com |
Education / Junior Class Scholarship ? by Ibbaba(m): 4:30am On Jun 27, 2017 |
... |
Programming / Re: I Built A Chatbot For Cinema Lovers, Please Check It Out by Ibbaba(m): 4:09pm On Jun 05, 2017 |
can i mail you or call you please? |
Programming / Re: Chatbot by Ibbaba(m): 7:23am On May 25, 2017 |
Dekatron: Cool ,may I have your number or email contact please |
Programming / Re: Chatbot by Ibbaba(m): 11:18am On May 19, 2017 |
any one here who have developed bot from scratch? |
Programming / Re: Chatbot by Ibbaba(m): 11:17am On May 19, 2017 |
any one with any experience with machine learning algorithm here |
Programming / Re: Chatbot by Ibbaba(m): 11:17am On May 19, 2017 |
help ? |
Programming / ML Recomender System ??? by Ibbaba(m): 7:01pm On Mar 23, 2017 |
Anyone here built a recomender system using machine learning before in here, or any one working on something related please , any one whose expertise is ML ? |
Programming / AVL TREE In Go Programming Lang. by Ibbaba(m): 9:12pm On Feb 19, 2017 |
AVL tree in go programming language *Data structure* ,any one can take this as a challenge and *implement it in python programing language Any guru here who can attemp this Tree.go Package avltree import ( "errors" ) type Tree struct { root *Node } func NewTree(comparator func(a, b *Node) int) (*Tree) { comp = comparator return &Tree{} } func (tree *Tree) Insert(value interface{}) { n := create(value) rootNode := tree.root if rootNode == nil { n.height = 0 tree.root = n } else { rootNode.add(n, tree) } } func (tree *Tree) InOrderTraversal(do func(a *Node)) { inOrderTraversal(tree.root, do) } func (tree *Tree) PreOrderTraversal(do func(a *Node)) { preOrderTraversal(tree.root, do) } func (tree *Tree) PostOrderTraversal(do func(a *Node)) { postOrderTraversal(tree.root, do) } func (tree *Tree) Delete(node *Node) error { if node == nil { return errors.New("Couldn't found node with the value specified" } if node.IsLeave() { parent := node.parent parent.detachChild(node) tree.rebalance(parent) } if node.left != nil && node.right == nil { parent := node.parent parent.setLeft(node.left) tree.rebalance(parent) } else if node.left == nil && node.right != nil { parent := node.parent parent.setRight(node.right) tree.rebalance(parent) } if node.left != nil && node.right != nil { _, successor := tree.Successor(node) node.Value = successor.Value tree.Delete(successor) } return nil } func (tree *Tree) Find(value interface{}) (error, *Node){ n := create(value) foundNode := tree.compare(n, tree.root) if foundNode == nil { return errors.New("Node was not found", nil } return nil, foundNode } func (tree *Tree) Successor(node *Node) (error, *Node) { if node.right != nil { return nil, tree.min(node.right) } else { return errors.New("Node has no right child", nil } } func (tree *Tree) min(node *Node) *Node{ if node.left == nil { return node } return tree.min(node.left) } func (tree *Tree) compare(node, current *Node) (*Node) { if current == nil { return nil } comparison := comp(current, node) if comparison == 0 { return current } else if comparison > 0 { return tree.compare(node, current.right) } else { return tree.compare(node, current.left) } } func (tree *Tree) rebalance(node *Node) { if node != nil { node.updateHeight() if !node.IsBalanced() { bf := balancedFactor(node) if bf > 0 { bfNext := balancedFactor(node.left) if bfNext == 0 || bfNext == 1{ leftLeftRotation(node, tree) } else { leftRightRotation(node, tree) } } else { bfNext := balancedFactor(node.right) if bfNext == 0 || bfNext == 1{ rightRightRotation(node, tree) } else { rightLeftRotation(node, tree) } } } else { tree.rebalance(node.parent) } } } func inOrderTraversal(node *Node, do func(a *Node)) { if node != nil { inOrderTraversal(node.left, do) do(node) inOrderTraversal(node.right, do) } } func preOrderTraversal(node *Node, do func(a *Node)) { if node != nil { do(node) preOrderTraversal(node.left, do) preOrderTraversal(node.right, do) } } func postOrderTraversal(node *Node, do func(a *Node)) { if node != nil { postOrderTraversal(node.left, do) postOrderTraversal(node.right, do) do(node) } } • Node .go • package avltree • • import ( • "math" • "errors" • ) • • type Node struct { • parent *Node • Value interface{} • left *Node • right *Node • height int • } • • var comp func(a, b *Node) int • • func create(value interface{}) (node *Node) { • return &Node{Value:value} • } • • func getHeight(node *Node) int { • if node != nil { • return node.height • } • return -1 • } • • func balancedFactor(node *Node) int { • left := getHeight(node.left) • right := getHeight(node.right) • return left - right • } • • func (n *Node) add(child *Node, tree *Tree) { • greaterFactor := comp(n, child) • if greaterFactor > 0 { • if n.right != nil { • n.right.add(child, tree) • } else { • n.setRight(child) • } • } else { • if n.left != nil { • n.left.add(child, tree) • } else { • n.setLeft(child) • } • • } • • n.updateHeight() • if !n.IsBalanced() { • rotate(n, tree) • } • • } • • func (n *Node) updateHeight() { • hleft := getHeight(n.left) • hright := getHeight(n.right) • n.height = int(math.Max(float64(hleft), float64(hright))) + 1 • } • • func (n *Node) Left() (*Node) { • return n.left • } • • func (n *Node) Right() (*Node) { • return n.right • } • • func (n *Node) IsLeave() bool { • return n.right == nil && n.left == nil • } • • func (n *Node) IsBalanced() bool { • return math.Abs(float64(balancedFactor(n))) < 2 • } • • func (n *Node) GetHeight() int { • return n.height • } • • func (n *Node) GetParent() (*Node) { • return n.parent • } • • func (n *Node) setLeft(node *Node) { • n.left = node • if node != nil { • node.parent = n • } • } • • func (n *Node) setRight(node *Node) { • n.right = node • if node != nil { • node.parent = n • } • } • • func (n *Node) detachChild(node *Node) error { • if n.left == node { • n.left = nil • node.parent = nil • return nil • } • • if n.right == node { • n.right = nil • node.parent = nil • return nil • } • • return errors.New("Node wasn't found" • } • • func rotate(n *Node, tree *Tree) { • if !n.IsBalanced() { • bf := balancedFactor(n) • if bf > 0 { • bfNext := balancedFactor(n.left) • if bfNext > 0 { • leftLeftRotation(n, tree) • } else { • leftRightRotation(n, tree) • } • } else { • bfNext := balancedFactor(n.right) • if bfNext > 0 { • rightLeftRotation(n, tree) • } else { • rightRightRotation(n, tree) • } • } • } • } • • func leftLeftRotation(pivot *Node, tree *Tree) { • child := pivot.left • • // House keeping • fixTree(pivot, child, tree) • • pivot.setLeft(child.right) • child.setRight(pivot) • • updateChild(child) • • } • • func leftRightRotation(pivot *Node, tree *Tree) { • rightRightRotation(pivot.left, tree) • leftLeftRotation(pivot, tree) • } • • func rightRightRotation(pivot *Node, tree *Tree) { • child := pivot.right • • fixTree(pivot, child, tree) • • pivot.setRight(child.left) • child.setLeft(pivot) • • updateChild(child) • } • • func rightLeftRotation(pivot *Node, tree *Tree) { • leftLeftRotation(pivot.right, tree) • rightRightRotation(pivot, tree) • } • • func fixTree(pivot, pivotChild *Node, tree *Tree) { • if tree.root == pivot { • tree.root = pivotChild • pivotChild.parent = nil • } else { • if pivot.parent.left == pivot { • pivot.parent.setLeft(pivotChild) • } else { • pivot.parent.setRight(pivotChild) • } • } • } • • func updateChild(child *Node) { • if child.left != nil { • child.left.updateHeight() • } • • if child.right != nil { • child.right.updateHeight() • } • child.updateHeight() • } |
Programming / Re: Chatbot by Ibbaba(m): 11:27pm On Feb 07, 2017 |
Thank you dekatron for your reply. I am fairly new to all of this, but I just got done reading/researched on chatbots , I think it’s within the ballpark of what am trying to achieve,solving a problem using machine learning techniques,I just need help(how, what, ,why,best approach, techniques for a novice school project) and detail explanations from experienced hands. |
Programming / Re: Chatbot by Ibbaba(m): 11:24pm On Feb 07, 2017 |
Thank you dekatron for your reply. I am fairly new to all of this |
Programming / Re: Chatbot by Ibbaba(m): 11:16pm On Feb 07, 2017 |
Dekatron: Yes I truly do, I think they used chatfuel, pandaroabot and other chatbot platrms. am not really good in java,just started learning node js ,am not that smart and there is no much time on my side bro. Well am a learner and i want help in my chatbot project. First of all the aim of my project is developing a customer service chatbot (interacts with the users,providing them with the needed information and solving their problems) So, what i’m struggling now is how to make it intelligent or in other words make it learn and grow after each conversation. There are many and many ML algorithms that i couldn't decides which one is the best. So, if any one here can help me either by providing examples, suggestion or a solution to this problem that will be very very helpful. thank you, |
Programming / Re: Chatbot by Ibbaba(m): 10:34pm On Feb 07, 2017 |
Hey fam. of great platform with great information. I 'm a bachelors degree student in computer sciences, ,i can to a certain level code in (HTML,CSS,JAVASCRIPT and PHP) with a little moderate level of python. My project supervisor insist I solve a problem on machine learning, so I have an idea in mind which is which is to develop a conversational customer service bots for telecom industry in my country, to assist users in getting information like data plan,voice migration plans,codes, Internet configuration details e.t.c This is to simplify getting valid and clear information without doing more of research ,using search engines or Google app and face difficulties in finding right information. The bot is gonna be a desktop app,with a serious documentation and presentation, because the grading system are going be interested in model, method, algorithm, api, libraries used. and the bot has to read and learn from users input and reply with a response, which has to be a correct information to users specific request and also should allow a bit of conversation features. FOR the purpose of clarity I need help to make choices through experience developers in this platform. PLEASE guide and advice me theoretically on how to achieve this and get an A GRADE. THANK YOU inadvance.m |
Programming / Chatbot by Ibbaba(m): 10:33pm On Feb 07, 2017 |
Hey fam.! I am new here I 'm a bachelors degree student in computer sciences, ,i can to a certain level code in (HTML,CSS,JAVASCRIPT and PHP) with a little moderate level of python. My project supervisor insist I solve a problem on machine learning, so I have an idea in mind which is which is to develop a conversational customer service bots for telecom industry in my country, to assist users in getting information like data plan,voice migration plans,codes, Internet configuration details e.t.c This is to simplify getting valid and clear information without doing more of research ,using search engines or Google app and face difficulties in finding right information. The bot is gonna be a desktop app,with a serious documentation and presentation, because the grading system are going be interested in model, method, algorithm, api, libraries used. and the bot has to read and learn from users input and reply with a response, which has to be a correct information to users specific request and also should allow a bit of conversation features. FOR the purpose of clarity I need help to make choices through experience developers in this platform. PLEASE guide and advice me theoretically on how to achieve this and get an A GRADE. THANK YOU inadvance.m 1 Like |
Technology Market / Re: ... by Ibbaba(m): 8:32am On Jan 07, 2017 |
available |
Technology Market / Re: ... by Ibbaba(m): 6:21pm On Dec 31, 2016 |
65,negociable |
Technology Market / Re: ... by Ibbaba(m): 7:20am On Dec 30, 2016 |
Available |
Technology Market / Re: ... by Ibbaba(m): 7:20am On Dec 30, 2016 |
available |
(1) (2) (3) (4) (5) (6) (7) (8) (9) (10) (of 11 pages)
(Go Up)
Sections: politics (1) business autos (1) jobs (1) career education (1) romance computers phones travel sports fashion health religion celebs tv-movies music-radio literature webmasters programming techmarket Links: (1) (2) (3) (4) (5) (6) (7) (8) (9) (10) Nairaland - Copyright © 2005 - 2024 Oluwaseun Osewa. All rights reserved. See How To Advertise. 41 |