1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
bulgar [2K]
4 years ago
13

Discuss the differences between dimensionality reduction based on aggregation and dimensionality reduction based on techniques su

ch as PCA and SVD.
Computers and Technology
1 answer:
abruzzese [7]4 years ago
5 0

Answer:

Following are the difference to this question can be defined as follows:

Explanation:

  • In terms of projections of information into a reduced dimension group, we can consider the dimension structure of PCA and SVD technologies.  
  • In cases of a change in the length, based on consolidation, there's also a unit with dimensions.
  • When we consider that the days have been aggregated by days or the trade of a commodity can be aggregated to both the area of the dimension, accumulation can be seen with a variance of dimension.
You might be interested in
Can someone tell me what this means Higfaa
Arisa [49]

Answer:

it's a Jamaican slang

Explanation:

it depends on the wah it is used

7 0
3 years ago
Zoe wants to post something controversial online, but then she remembers that employers may look at her social media when she st
allsm [11]

Answer:

D

Explanation:

7 0
3 years ago
What does it mean "Be Proactive"?
joja [24]

Answer:controlling a situation by making things happen or by preparing for possible future problems

Explanation:

4 0
3 years ago
Read 2 more answers
Suppose that, even unrealistically, we are to search a list of 700 million items using Binary Search, Recursive (Algorithm 2.1).
damaskus [11]

Answer:

There is also an attachment below

Explanation:

Since we are talking about binary search, let's assume that the items are sorted according to some criteria.

Time complexity of binary search is O(logN) in worst case, best case and average case as well. That means it can search for an item in Log N time where N is size of the input. Here problem talks about the item not getting found. So, this is a worst case scenario. Even in this case, binary search runs in O(logN) time.

N = 700000000.

So, number of comparisions can be log(N) = 29.3 = 29.

So, in the worst case it does comparisions 29 times

7 0
3 years ago
A hub is a central computer true or false?
klio [65]

Answer:

hub is central computer.....True...

4 0
3 years ago
Read 2 more answers
Other questions:
  • Assume that scotus is a two-dimensional character array that stores the family names (last names ) of the nine justices on the S
    6·1 answer
  • In which step of web design is storyboarding helpful?
    14·1 answer
  • How to add running head and page number in word?
    5·1 answer
  • The meaning of belt drives
    10·1 answer
  • Which statement describes how to insert the IF, COUNTIF, or SUM function into a cell?
    12·1 answer
  • Need answer ASAP!!!!!
    6·1 answer
  • State four reasons why office automation is adopted in business establishment?​
    7·1 answer
  • HOMEWORK: Bud, Not Buddy I NOTICE... What do you see? chpter 3-4<br><br>​
    14·1 answer
  • What is the term for unsolicited Email​
    15·1 answer
  • Which data type does not allow duplicate values-python
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!