Data Visualization and Knowledge Engineering: Spotting Data Points with Artificial Intelligence - podcast episode cover

Data Visualization and Knowledge Engineering: Spotting Data Points with Artificial Intelligence

May 18, 202621 min
--:--
--:--
Download Metacast podcast app
Listen to this episode in Metacast mobile app
Don't just listen to podcasts. Learn from them with transcripts, summaries, and chapters for every episode. Skim, search, and bookmark insights. Learn more

Episode description

Explores how artificial intelligence is used to identify and analyze complex data points. A significant portion of the material focuses on cross-project defect prediction, a method in software engineering that utilizes external datasets to anticipate errors in new software. The authors conduct experiments using machine learning classifiers and the SMOTE algorithm to demonstrate that predicting defects across different projects is as effective as traditional within-project methods. By addressing class imbalance issues through oversampling, the research highlights how specific object-oriented metrics can improve software quality and reliability. Additionally, the sources touch upon broader applications of these technologies, including recommendation systems for interactive entertainment and semantic segmentation for satellite imagery.

You can listen and download our episodes for free on more than 10 different platforms:
https://linktr.ee/cyber_security_summary

Get the Book now from Amazon:
https://www.amazon.com/Data-Visualization-Knowledge-Engineering-Communications/dp/3030257967?&linkCode=ll2&tag=cvthunderx-20&linkId=614f4cb066b45f2d537535bc7e724fc0&language=en_US&ref_=as_li_ss_tl

Discover our free courses in tech and cybersecurity, Start learning today:
https://linktr.ee/cybercode_academy

Transcript

Speaker 1

Usually when we talk about making a diagnosis, there's this expectation of pure mechanical precision.

Speaker 2

Right, like a very comforting binary exactly.

Speaker 1

I mean, think about breaking your arm. You go to the hospital, they take the X ray, and you see that jagged white line on the black film, and the doctor just points and says, you know, there it is.

Speaker 2

Yeah, it's incredibly visible. We have this fundamental human bias toward things we can see, right, things we can categorize and just put into neat little boxes broken or not broken.

Speaker 1

But then if you zoom out and look at the digital world that you are interacting with right now, I mean the apps on your phone, the movie recommendations popping up on your TV, or even the software protocols keeping your bank account secure.

Speaker 2

Yeah, suddenly that X ray machine is just entirely useless.

Speaker 1

Completely useless, because when you engage with modern technology, you are stepping inside this invisible architecture. You're completely surrounded by these complex decisions and predictions that are being made in the app slute dark, and.

Speaker 2

The sheer volume of data flowing through that architecture is so massive. I mean, human eyes couldn't possibly find those jagged white lines even if they knew exactly what to look for.

Speaker 1

Right. The scale of it all just demands that we rely on algorithms to do the spotting for us, which honestly is exactly why we are diving into the material you sent over today.

Speaker 2

It's a really fascinating collection of research, it really is.

Speaker 1

So we're looking at excerpts from this incredibly dense but honestly illuminating academic compilation. It's titled Data Visualization and Knowledge Engineering Spotting Data Points with Artificial Intelligence, and we are pulling from three distinct research chapters today, spanning software engineering, multimedia recommendation engines, and computer vision.

Speaker 2

Right, which sounds like three completely different worlds.

Speaker 1

Yeah, but our mission for this deep dive is to show you how they're connected. By the end of this conversation, you're going to understand the brilliant, completely silent mathematics that decide what you see here and use every single day.

Speaker 2

Because what stands out immediately across all these seemingly disparate fields is the shared underlying logic. These systems all basically rely on taking an overwhelmingly chaotic environment, finding the mathematical neighbors or the hidden patterns within it. And then using that specific geometry to predict a future outcome.

Speaker 1

Okay, so let's start right at the foundation of that digital world, which is the code itself. Before an AI can say, curate your evening entertainment or organize your vacation photos, the underlying software running those platforms has to actually function.

Speaker 2

It has to work, yeah, which brings up a really fascinating problem for developers.

Speaker 1

Right because when a tech company has millions of lines of code, they obviously can't manually test every single permutation before launch.

Speaker 2

They absolutely cannot. They have to optimize their quality assurance resources. So historically, developers relied heavily on something called WPDP.

Speaker 1

Which is within project defect prediction.

Speaker 2

Exactly within project defect prediction and the mechanism there is it's fairly intuitive. If version one point zero of your software crashed because of let's say a memory leak in a specific login module.

Speaker 1

The model just learns to aggressively check that exact same log in module when you build version two point out right.

Speaker 2

It scrutinizes the historical weak points, which.

Speaker 1

Makes total sense. If you actually have a version one point zero, you're learning from your own past mistakes. But if you are launching a brand new piece of software. You have zero pass data. I mean you are flying completely blind.

Speaker 2

You are, And that is where the shift to CPDP comes in. That's the frontier right now.

Speaker 1

Cross project defect prediction.

Speaker 2

Yes, so instead of relying on your own non existent history, the algorithm uses massive sets of training data from completely different outside software projects to find the hidden bugs in your new code.

Speaker 1

Okay, let's unpack this for a second, because the logic here is just wild to me. This is basically like trying to predict where the plumbing is going to leak in a brand new, half built.

Speaker 2

Skyscraper by studying the plumbing failures of completely different skyscraper across town exactly.

Speaker 1

I mean, how does that even work.

Speaker 2

It's actually a brilliant way to conceptualize it. Your skyscraper analogy. You are working on the assumption that because both structures use you know, pipes, water pressure, and gravity, the physical stress points will behave similarly, even if.

Speaker 1

The architectural floor plans are wildly different.

Speaker 2

Exactly, and the source material mentions four specific ways they set up this cross project training right.

Speaker 1

I have them here. It's strict mixed mixed with target class and pair wise.

Speaker 2

So strict means the training data is completely blind to your new software. It only uses outside projects period. Okay, mixed folds in older, perhaps slightly related projects alongside the outside data now mixed with target class is really interesting because it takes a tiny labeled sample from your current unfinished project to give the algorithm just a slight hint about your specific architecture, kind of like.

Speaker 1

Showing at a rough blueprint before it checks the pikes, right.

Speaker 2

And then pairwise is a strict one to one mapping. The model is trained entirely on one single outside project and then test it entirely on yours.

Speaker 1

But I'm trying to visualize what the AI is actually looking at here, because it's not reading the code like a human programmer, right, Yeah, it's not scanning for a missing semicolon.

Speaker 2

No, No, it's looking at structural metrics. The text highlights something called CK metrics, which measure the complexity of object oriented software.

Speaker 1

What's an example of a CK metric?

Speaker 2

A good example is the depth of inheritance tree.

Speaker 1

Depth of inheritance tree. Okay, what does that mean practically?

Speaker 2

Well, imagine code like a family tree. If a piece of code inherits traits from say, ten generations of parent code above it. It is deeply nested.

Speaker 1

Oh I see, and if you change one thing at the very top of that ten generation tree, it probably just breaks everything at the bottom.

Speaker 2

Exactly the point it's incredibly fragile. Or the AI looks at something like weighted methods per class, which basically measures how many different operations a single piece of code is trying to juggle all at once.

Speaker 1

So the algorithm isn't looking for a broken line of chade, it's scanning for structural fragility.

Speaker 2

Yes, mathematically extreme complexity is basically the breeding ground for bugs.

Speaker 1

Okay, I have to push back here though, just putting myself in the shoes of the engineers. If a commercial software project is, say, mostly successful, wouldn't bugs be incredibly rare?

Speaker 2

They are relatively speak.

Speaker 1

Right, So, say ninety nine percent of the code is structurally sound and only one percent is actually defective. If you feed an AI that data, doesn't the math just break. I mean, the AI could literally just look at any line of code blindly guess no bug and be mathematically correct. Ninety nine percent of the time.

Speaker 2

You've just identify, honestly, one of the most notorious hurdles in machine learning. It's called the class imbalance problem.

Speaker 1

Class imbalance problem.

Speaker 2

Yeah, when one outcome is overwhelmingly common, the algorithm just takes the path of least mathematical resistance, learns to ignore the rare anomaly the bug because optimizing for the ninety nine percent yields a fantastic accuracy score on paper.

Speaker 1

So how do they actually solve that? Because you can't just copy and paste that one where bug one hundred times to balance the spreadgy Right, that seems like it would just teach the AI to memorize one specific mistake, and you'd.

Speaker 2

Be totally right. Over sampling by just copying data does exactly that. The AI memorizes the duplicate, it overfits to it, and then becomes entirely useless at finding new types of bugs.

Speaker 1

Okay, so what's the fix.

Speaker 2

Instead, the researchers utilized a highly sophisticated statistical technique called SEMOT.

Speaker 1

Which stands for synthetic minority over sampling technique.

Speaker 2

Yes, and somemisode doesn't duplicate. What it does is calculate the mathematical distance between the rare bug data points in multidimensional space.

Speaker 1

Whoa multidimensional space. Okay, slow down.

Speaker 2

Let's simplify it. Imagine a scatter plot graph with two real bugs plotted on it. Smow T draws a line between those two points and mathematically synthesizes an entirely new artificial bugs somewhere along that line.

Speaker 1

Oh wow. Wait, really, so they aren't just finding bugs. They're essentially cloning the DNA of a mistake exactly. They are hallucinating highly realistic structural flaws to force the AI to become a better detective.

Speaker 2

It balances the scales not with repetition, but with synthetic diversity. And when the researchers combine some mote with a gradient boosting algorithm called xg boost, which by the way, is exceptional at handling complex tabular data, their cross project prediction accuracy reached up to eighty eight percent.

Speaker 1

Eighty eight percent. It completely flips how I thought quality assurance worked. It proves that algorithms can successfully predict structural failure just by studying the mathematical neighborhood.

Speaker 2

It does, and I.

Speaker 1

Mean if AI can synthesize fake data to fixed broken code, it raises a much bigger question for me. Can we apply that exact same neighborly logic to human behavior.

Speaker 2

Oh, absolutely, which takes us straight into the mechanics of recommendation systems, you know, the systems deciding what song, product or movie you interact with next. Broadly speaking, the industry relies on two philosophies, content based filtering and collaborative filtering.

Speaker 1

Content based seems pretty intuitive to me. If I watch a documentary about, say, deep sea diving, the algorithm tags the features yea, like ocean submarines, greene biology, and then it just recommends another documentary with those same exact tags.

Speaker 2

Yeah, it's essentially property matching. The limitation, however, is that content based filtering traps you in a very predictable bubble. It has no mechanism to surprise you with something outside of those literal.

Speaker 1

Tags, right, You're just stuck in a submarine loop.

Speaker 2

Forever, exactly. And that is why platforms pivot heavily toward collaborative filtering.

Speaker 1

And this is where the math gets really interesting.

Speaker 2

Because collaborative filtering doesn't actually care what the movie or song is about. It completely ignores the content tags.

Speaker 1

Wait, it ignores them entirely.

Speaker 2

Entirely, it only cares about the behavioral patterns of the people consuming it. It takes all of your clicks, your views, and ratings and plots them on this massive mathematical grid called a user item matrix. Okay, then it uses clustering algorithms like k means clustering to map you into a specific locality of other users who share your precise behavioral footprint.

Speaker 1

So collaborative filtering is basically like walking into a massive, crowded party, finding the one total stranger who likes the exact same weird indie band as you, and then blamely trusting their movie recommendation for the rest of the night.

Speaker 2

That's it, But it goes even further than that. The AI assumes that your agreement on past choices is actually a mathematical vector pointing toward your next choice.

Speaker 1

Meaning what exactly?

Speaker 2

Meaning, if you and this cluster of strangers agreed on your last fifty interactions, the system is statistically confident you will enjoy the fifty first thing they liked, even if it's a completely different genre that you've never even explored.

Speaker 1

But wait, looking at the source material, what happens when there is no history to match, Like the text brings up the cold start problem.

Speaker 2

Ah, yes, the cold start right, Because if I am a brand new user, my row on that user item matrix is completely blank. Or if a musician uploads a brand new track five seconds ago, it is zero listener data. How does this system ever recommend it? Doesn't the math just break down?

Speaker 1

The math does indeed break down. There the user itta matrix becomes too sparse. It's like a giant spreadsheet where ninety nine percent of the cells are just empty. You can't calculate a vector from nothing, So.

Speaker 2

What's the worker ind Well, this is why the state of the art approach relies on hybrid models. They layer collaborative and content based filtering together and then they integrate context from the Internet of Things or IoT.

Speaker 1

Right, they pull in real world unstructured data and the source text actually has this incredible real world case study to prove how powerful this is. Getting the story of miss Swati preside.

Speaker 2

Yes, it's a perfect illustration of how predictive analytics has evolved from just tracking what you clicked yesterday.

Speaker 1

So you had the stage for us.

Speaker 2

Yeah, there was an AI engine named Missin developed by ic Terra Science and its goal was to predict future talent. So it didn't just look at a sparse matrix of song ratings. It utilized natural language processing or NLP, to analyze her entire digital footprint.

Speaker 1

Okay, so what is the actual mechanism there? How does an algorithm read a digital footprint and spit out a prediction for stardom?

Speaker 2

So NLP allows the algorithm to map human language to mathematical weights. The messin Engines scraped the web for her college performances at engineering fest.

Speaker 1

Wow, it went that deep, it.

Speaker 2

Did, and it analyzed the semantic sentiment of the lyrics she was singing, basically calculating the emotional resonance of her words. On top of that, attracted her social media interactions, mapping the velocity and the sentiment of the comments around her.

Speaker 1

So it's assigning mathematical values to the emotional reaction she's generating online and then comparing that shape to the historical data of artists who actually made it big.

Speaker 2

Exactly. It synthesized all that unstructured context and predicted that she would make a debut as a playback singer in Bollywood.

Speaker 1

Which actually had I mean, she ended up singing for a feature film. The recommendation system wasn't just reacting to pass clicks. It was actively discovering latent human talent by identifying the mathematical signature of future popularity.

Speaker 2

It's a profound shift really in how we understand discovery. These algorithms. They're no longer just mirrors showing us what we already did. They are predictive oracles. They find the talent and immediately match it with the cluster of users who are mathematically primed to receive it.

Speaker 1

It's brilliant. Oh, but you know it deals with recommending or finding one specific thing, one song, one artist. What happens when the problem isn't picking one thing but trying to distill thousands of things. I mean, we all have thousands of photos sitting on our phones right now. How does an AI look at a massive visual data set and summarize it without losing the big picture?

Speaker 2

You're touching on the immense challenge of image collection summarization. To process that kind of visual noise, the algorithm has to choose a summarization philosophy. This material contrasts extractive summarization with abstractive summarization.

Speaker 1

Okay, if we think about this in terms of sports, extractive summarization would be like the highlight reel. You're pulling the actual untouched video clips of the best plays exactly, and abstractive would be the sports reporter writing a brand new article summarizing the game.

Speaker 2

That's spot on. Abstractive means the AI extracts the essence of the data and generate something entirely new, like a text summary. But the researchers note this is highly impractical for personal image collection, Right.

Speaker 1

I don't want an AI to generate a fake composite image to summarize my actual family vacation.

Speaker 2

No, you want your actual photos. So we rely on extractive summarization.

Speaker 1

But how does a computer look at a thousand pixels and mathematically decide what makes a good highlight?

Speaker 2

Well? The text details two main mathematical approaches to extractive summarization. The first is the similarity based approach. The goal here is to find the canonical view, and.

Speaker 1

A canonical view is what exactly the definitive angle?

Speaker 2

Yes, think of the most universally recognizable angle of the Eiffel Tower. To find this in your photos, the AI builds an eigen model.

Speaker 1

Hold on eigenmodel sounds incredibly dense. What is that practically doing? Is it just like averaging all the colors together.

Speaker 2

Not just colors. It's extracting the structural skeleton of the images. It maps out multidimensional features you know, edges, lighting, shapes, and it plots every photo in mathematical space.

Speaker 1

Okay, I'm falling.

Speaker 2

Then it uses something called cosine similarity. This calculates the geometric angle between the data points by finding the photos with the tightest angles to one another. It clusters similar images together and extracts the one photo sitting dead center in that cluster.

Speaker 1

So it looks at fifty photos of my dog at the beach, groups them by their structural skeleton, finds the mathematical dead center, and declares this is the canonical beach dog photo.

Speaker 2

That's the similarity approach.

Speaker 1

Yes, yeah.

Speaker 2

Now contrast that with the reconstruction based approach, which actually treats your photo album like a data compression problem.

Speaker 1

Data compression, right.

Speaker 2

It uses a dictionary of sparse representations and relies on minimizing something called L to norm error.

Speaker 1

Okay, L two norm error. I need an analogy here to wrap my head around that. Think of L two norm error like freeze drying a meal.

Speaker 2

Freeze drying, okay, Yeah.

Speaker 1

You remove all the water, which is the bulk of the weight distored efficiently, and if you add water back later and the meal tastes exactly like the original. The error in your freeze drying process zero.

Speaker 2

That is actually a highly accurate way to look at it. The algorithm is freeze drying your photo album. It asks a purely mathematical question, if I only keep these five photos out of one hundred, can I use their specific mathematical features to perfectly reconstruct the data of the missing ninety five. The five photos become the basis set, and the L to norm error is simply the mathematical difference

between your original massive album and the algorithm's estimation. If the error is tiny, the summary is highly representative.

Speaker 1

But wait, putting myself in your shoes for a second, looking at my own camera role, pure math doesn't understand sentiment.

Speaker 2

No it doesn't.

Speaker 1

If the AI just optimizes for this L two norm error, it might pick five technically perfect photos that completely miss the emotional point of my trip, Like my favorite photo might be blurry or off center. Isn't a highlight? Real? Incredibly subjective?

Speaker 2

This is a crucial limitation. It really is. If you only use pure geometry, you get a mathematically perfect summary that feels totally alien to a human And that is exactly why the researchers introduce task specific summarization.

Speaker 1

Meaning the AI needs to know why you want the summary before it does the mask.

Speaker 2

Exactly, it filters the math through a layer of human intent.

Speaker 1

So how does it actually do that?

Speaker 2

The researchers build a deep learning architecture using a scorer network, so before it ever clusters a photo, it evaluates every single image based on three specific criteria relevance, diversity, and redundancy.

Speaker 1

Well, diversity and redundancy makes sense, you want it to and angles. You obviously don't want five identical pictures of the same sunset. But how does an algorithm measure subjective relevance?

Speaker 2

It uses a pre trained classifier. The AI takes the image's mathematical properties, it's feature vector, and multiplies it by a probability score that was generated for your specific task.

Speaker 1

Okay, give me an example.

Speaker 2

Say your task is show me the architectural highlights of my trip. The classifier acts as a filter, boosting the mathematical weight of buildings and drastically lowering the weight of selfies or food.

Speaker 1

So it's forcing the geometry to respect the context.

Speaker 2

Precisely, and the text notes this ensures the summary is a topologically invariant representation.

Speaker 1

Okay, let's ELI five that explain, like I'm five. Topologically invariant means what the shape of the memory survives.

Speaker 2

Yes, in topology, you can stretch or shrink an object, but as long as you don't pair it or punch new holes in it, it's fundamental property. Its invariant shape remains.

Speaker 1

Ah, it's beautiful.

Speaker 2

By using scorer networks, the AI can shrink a ten thousand photo album down to ten photos, but the fundamental shape of your memory, tailored specifically for what you care about, remains perfectly intact.

Speaker 1

You know, it is genuinely remarkable how interconnected all these concepts are. We started by looking at how AI clones the structural DNA of a mistake to predict software failure. Then we move to how IT clusters our behavioral footprints in an N dimensional matrix to predict cultural success, and we finished with how it uses sparse reconstruction and scorer networks to freeze dryer visual chaos into perfect, meaningful summaries.

Speaker 2

And the thread binding it all together is the mathematics of relationships. Data doesn't exist in a vacuum. Once an algorithm understands how a single piece of data relates to the neighborhood around it, it can predict the future of that entire neighborhood, which.

Speaker 1

Brings us entirely back to you listening right now. Every time you open a streaming app, search your camera roll, or rely on a banking protocols to securely process a transaction, you are really on this invisible architecture. Cess's MOTI balancing the scales, collaborative filtering, finding your digital neighbors, sparse reconstruction, distilling the noise.

Speaker 2

It's everywhere.

Speaker 1

These algorithms are silently working in the background to save you time, curate your worldview, and keep the digital plumbing from collapsing.

Speaker 2

It really reframes how we interact with our own data, and if we connect these capabilities to the bigger picture, it leaves us with something quite profound to consider exactly, well, if algorithms can synthesize artificial bugs to predict a software crash, and if NLP can mine unstructured social media texts to

predict the exact moment someone becomes a star. And if mathematical models can find the perfect canonical view of a massive photo album, what happens when these incredibly powerful systems are turned toward the data of your entire life?

Speaker 1

Oh wow?

Speaker 2

If a machine can distill a data set down to its fundamental shape, what is the canonical view of you?

Speaker 1

Oh man, that is a heavy, fascinating question. To walk away with the idea of an algorithm zooming out on your entire digital footprint and just picking the ten frames that mathematically reconstruct your essence. I love that. Thank you for handing us this incredible research today and joining us as we explore the invisible architecture around us. Keep questioning the algorithms and we will catch you on the next deep dive.

Transcript source: Provided by creator in RSS feed: download file
For the best experience, listen in Metacast app for iOS or Android